New posts in big-o

What are the rules for the "Ω(n log n) barrier" for sorting algorithms?

performance algorithm sorting big-o lower-bound

Why is accessing an element of a dictionary by key O(1) even though the hash function may not be O(1)?

c# dictionary hashtable big-o

multiset, map and hash map complexity

c++ complexity-theory big-o

Example of O(n!)?

java algorithm big-o complexity-theory factorial

What is the complexity of regular expression?

regex complexity-theory big-o

Understanding Time complexity calculation for Dijkstra Algorithm

algorithm graph big-o time-complexity dijkstra

Computing set intersection in linear time?

big-o set-intersection algorithm math data-structures

Is Big O(logn) log base e?

math binary-tree complexity-theory big-o

O(nⁿ) complexity pseuodocode structure using loops or recursion

algorithm time-complexity big-o

What is the difference between lower bound and tight bound?

What would cause an algorithm to have O(log n) complexity?

algorithm big-o time-complexity logarithm

Time complexity of python set operations?

python data-structures set complexity-theory big-o

Python dictionary keys. "In" complexity

python dictionary hashmap complexity-theory big-o

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

java algorithm data-structures stack big-o

Big O of JavaScript arrays

javascript arrays algorithm big-o time-complexity

Is this technically an O(1) algorithm for "Hello World"?

c# .net algorithm big-o

What is pseudopolynomial time? How does it differ from polynomial time?

algorithm big-o time-complexity

What would cause an algorithm to have O(log log n) complexity?

algorithm big-o time-complexity complexity-theory logarithm

Maximum single-sell profit

arrays algorithm big-o time-complexity

Finding Big O of the Harmonic Series

time-complexity big-o complexity-theory