tagged [big-o]
Which is better: O(n log n) or O(n^2)
Which is better: O(n log n) or O(n^2) Okay so I have this project I have to do, but I just don't understand it. The thing is, I have 2 algorithms. and . Anyway, I find out in the project info that if ...
- Modified
- 19 Mar at 09:34
How can building a heap be O(n) time complexity?
How can building a heap be O(n) time complexity? Can someone help explain how can building a heap be complexity? Inserting an item into a heap is , and the insert is repeated n/2 times (the remainder ...
- Modified
- 30 Apr at 15:34
Determining complexity for recursive functions (Big O notation)
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 how to solve ...
- Modified
- 7 Jun at 10:23
What are the complexity guarantees of the standard containers?
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 betw...
- Modified
- 9 Nov at 17:15
Examples of Algorithms which has O(1), O(n log n) and O(log n) complexities
Examples of Algorithms which has O(1), O(n log n) and O(log n) complexities What are some algorithms which we use daily that has O(1), O(n log n) and O(log n) complexities?
- Modified
- 2 Jan at 20:20