-
Kadane's Algorithm
Maximum subarray problem has a brute force solution of O(n2). Using Kadane's algorithm we can solve the problem in O(n) time.
-
Algorithm's Order of Growth
Every software engineer should remember this chart. Big O concepts are really important expecially when designing APIs.
-
Notes on Quiescent Search & Branching Factor
My notes on algorithmic concepts.
-
Notes on Iterative Deepening
My notes on algorithmic concepts.