Top "Big-o" questions

The Big-O notation is used to represent asymptotic upper bounds.

What does O(log n) mean exactly?

I am learning about Big O Notation running times and amortized times. I understand the notion of O(n) linear …

algorithm time-complexity big-o
Big O, how do you calculate/approximate it?

Most people with a degree in CS will certainly know what Big O stands for. It helps us to measure …

algorithm optimization complexity-theory big-o performance
Computational complexity of Fibonacci Sequence

I understand Big-O notation, but I don't know how to calculate it for many functions. In particular, I've been trying …

time-complexity big-o complexity-theory fibonacci
Append an object to a list in R in amortized constant time, O(1)?

If I have some R list mylist, you can append an item obj to it like so: mylist[[length(mylist)+1]] &…

r performance list append big-o
How to merge two sorted arrays into a sorted array?

This was asked of me in an interview and this is the solution I provided: public static int[] merge(int[] …

java algorithm big-o mergesort
Difference between Big-O and Little-O Notation

What is the difference between Big-O notation O(n) and Little-O notation o(n)?

algorithm time-complexity big-o asymptotic-complexity little-o
Determining complexity for recursive functions (Big O notation)

I have a Computer Science Midterm tomorrow and I need help determining the complexity of these recursive functions. I know …

recursion big-o complexity-theory
How to find the kth largest element in an unsorted array of length n in O(n)?

I believe there's a way to find the kth largest element in an unsorted array of length n in O(…

performance algorithm big-o
Is log(n!) = Θ(n·log(n))?

I am to show that log(n!) = Θ(n·log(n)). A hint was given that I should show the upper …

algorithm math recursion complexity-theory big-o