Complexity

Binary Search: O(log N)
String reverse: O(N)
Linear search: O(N)
String Comparison: O(min(L1,L2))
Fibonacci: O(N)
Palindrome: O(N)
Looking for Substring: O(N)
Merge/Quick/Heap Sort: O(N*log N)
Bubble Sort: O(N*N)
Two Nested Loop: O (N*N)
Three Nested Loop: O(N*N*N)
Knapsack: O(N*M)
Naive Substring Find: O(L1*L2)
Brute Force Generation: O(2^N)
Stack Push/Pop: O(1)
Reversing Stack/Queue: O(N)
Queue Add/Delete: O(1)
Add/Remove to/from Heap: O(log N)
Add to Hash: O(1)
Check Hash: O(1)