I have a Computer Science Midterm tomorrow and I need help determining the complexity of these recursive functions. I know how to solve simple cases, but I am still trying to learn how to solve these harder cases. These were just a few of the example problems that I could not figure out. Any help … Read more
What is the difference between Big-O notation O(n) and Little-O notation o(n)? 5 Answers 5
Sometimes I see Θ(n) with the strange Θ symbol with something in the middle of it, and sometimes just O(n). Is it just laziness of typing because nobody knows how to type this symbol, or does it mean something different? 9 Answers 9
What is meant by “Constant Amortized Time” when talking about time complexity of an algorithm? 8 s 8 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 the best-case of that operation – what you care about is how much time … Read more
Can someone help explain how can building a heap be O(n) complexity? Inserting an item into a heap is O(log n), and the insert is repeated n/2 times (the remainder are leaves, and can’t violate the heap property). So, this means the complexity should be O(n log n), I would think. In other words, for … Read more
Most people with a degree in CS will certainly know what Big O stands for. It helps us to measure how well an algorithm scales. But I’m curious, how do you calculate or approximate the complexity of your algorithms? 24 s 24 I’ll do my best to explain it here on simple terms, but be … Read more
I am learning about Big O Notation running times and amortized times. I understand the notion of O(n) linear time, meaning that the size of the input affects the growth of the algorithm proportionally…and the same goes for, for example, quadratic time O(n2) etc..even algorithms, such as permutation generators, with O(n!) times, that grow by … Read more
I’d prefer as little formal definition as possible and simple mathematics. 4 43
Example of O(n!)?
Big Oh for (n log n)
