Grokking Algorithms

Can I start loving this journey?

The title is a tribute to this gorgeous title of the book: Grokking Algorithms

• I will include all topics here that I keep finishing.
• Binary Search: Split from the middle of the range and render useless the redundant half.
• Selection Sort
• Recursion
• Quick Sort
• Merge Sort
• Hash tables: hash functions and load factors.
• Graphs and graph algorithms
• Trees
• Divide and Conquer
• Queues
• Stacks
• Sets are good for keeping duplicates out.
• Breadth First Search
• Djikstra's algorithm
• Bellman Ford algorithm
• Greedy Algorithms
• NP Complete Problems
• Approximation Algorithms
• Dynamic Programming
• Longest Commong Substring
• Longest Commong Subsequence
• Regression
• Uncovered:
  • Trees like B-Trees, Red-black trees, Heaps, Splay Trees
  • Inverted Indexes
  • Fourier Transform
  • Parallel Algorithms
  • MapReduce
  • Distributed Algorithms
  • Bloom Filters
  • Hyperloglog
  • SHA Algorithms
  • Locality Sensitive Hashing
  • Diffie Hellman Key Exchange
  • Linear Programming

The next book that I picked up on this journey is the Algorithm Design Analysis by Steven Skiena.