What is Constant Amortized Time?
Amortised time explained in simple terms: If you do an operation say a million times, you don’t really care about the worst-case or … Read more
big-o
What are the complexity guarantees of the standard containers?
Apparently 😉 the standard containers provide some form of guarantees. What type of guarantees and what exactly are the differences between the different … Read more
Is a Java hashmap search really O(1)?
I’ve seen some interesting claims on SO re Java hashmaps and their O(1) lookup time. Can someone explain why this is so? Unless … Read more
Big-O summary for Java Collections Framework implementations? [closed]
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers. We don’t allow questions seeking recommendations for books, … Read more
Are 2^n and n*2^n in the same time complexity?
Resources I’ve found on time complexity are unclear about when it is okay to ignore terms in a time complexity equation, specifically with … Read more
Are there any worse sorting algorithms than Bogosort (a.k.a Monkey Sort)?
My co-workers took me back in time to my University days with a discussion of sorting algorithms this morning. We reminisced about our … Read more
What exactly does big Ө notation represent?
I’m really confused about the differences between big O, big Omega, and big Theta notation. I understand that big O is the upper … Read more
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(n). Or perhaps it’s … Read more
Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?
Are there are any cases where you would prefer O(log n) time complexity to O(1) time complexity? Or O(n) to O(log n)? Do … Read more
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 bound with nn and show … Read more
