Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in big-o

Quicksort superiority over Heap Sort

Why hashmap lookup is O(1) i.e. constant time?

What is the runtime complexity of a switch statement?

What is O(log(n!)) and O(n!) and Stirling Approximation

big-o

Big-O of list slicing

python list big-o

Finding Big O of the Harmonic Series

Space complexity of recursive function

big-o space-complexity

Why is the constant always dropped from big O analysis?

algorithm big-o analysis

Could anyone explain Big O versus Big Omega vs Big Theta? [duplicate]

Why is the computational complexity O(n^4)?

java big-o

Detecting if a string has unique characters: comparing my solution to "Cracking the Coding Interview?"

Time complexity of nested for-loop

Stack with find-min/find-max more efficient than O(n)?

O(n log n) vs O(n) -- practical differences in time complexity

Why is it impossible to find a specified value in a sorted array faster than O(log n)?

O(log N) == O(1) - Why not?

Why is the Big-O complexity of this algorithm O(n^2)?

Complexity of list.index(x) in Python

What is the Big-O of a nested loop, where number of iterations in the inner loop is determined by the current iteration of the outer loop?

big-o nested-loops

Which is better: O(n log n) or O(n^2)