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

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

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

Given that strings are immutable in .NET, I’m wondering why they have been designed such that string.Substring() takes O(substring.Length) time, instead of O(1)? … Read more

I have gone through Google and Stack Overflow search, but nowhere I was able to find a clear and straightforward explanation for how … Read more

Project Euler and other coding contests often have a maximum time to run or people boast of how fast their particular solution runs. … 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 … Read more

What is the most concise and efficient way to find out if a JavaScript array contains a value? This is the only way … Read more

I’d prefer as little formal definition as possible and simple mathematics. 4 43