The Big-O notation is used to represent asymptotic upper bounds.
After using PHP for a while now, I've noticed that not all built-in PHP functions are as fast as expected. …
php performance algorithm arrays big-oThis is my first course in data structures and every lecture / TA lecture , we talk about O(log(n)) . This …
algorithm data-structures complexity-theory big-o logarithmWhat is the big-O complexity of the function (log n)k for any k?
algorithm math complexity-theory big-o logarithmMy knowledge of big-O is limited, and when log terms show up in the equation it throws me off even …
algorithm big-o time-complexity logarithmSuppose we are given an array of n integers representing stock prices on a single day. We want to find …
arrays algorithm big-o time-complexityI am confused about the time complexity of hash table many articles state that they are "amortized O(1)" not true …
hashtable big-oI remembered that heap can be used to search whether an element is in it or not with O(logN) …
algorithm data-structures heap big-oI would like to know the complexity in Big O notation of the STL multiset, map and hash map classes …
c++ complexity-theory big-oI am working through the book "Cracking the Coding Interview" and I have come across questions here asking for answers, …
java string algorithm big-o time-complexityWhat is O(log(n!)) and O(n!)? I believe it is O(n log(n)) and O(n^n)? …
big-o