big-o Archives - IT Nursery

algorithm, Programming

IT Nursery

Closed. This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so ...

algorithm, Programming

IT Nursery

I’m really confused about the differences between big O, big Omega, and big Theta notation. I understand that big O is the upper ...

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 ...

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 ...

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 ...

This question already has answers here: What is a plain English explanation of “Big O” notation? (43 answers) Closed 4 years ago. I’m ...

Are there any O(1/n) algorithms? Or anything else which is less than O(1)? 32 Answers 32 This question isn’t as silly as it ...

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

After using PHP for a while now, I’ve noticed that not all built-in PHP functions are as fast as expected. Consider these two ...