## Are there any worse sorting algorithms than Bogosort (a.k.a Monkey Sort)? [closed]

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

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

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

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

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

If I have some R list mylist, you can append an item obj to it like so: mylist[[length(mylist)+1]] <- obj But surely there … Read more

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

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 … Read more

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 … Read more

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 … Read more