Grokking-Algorithms

An study repository where I save all the examples and exercises I while reading the the book "Grokking Algorithms" by Aditya Y. Bhargava.

---

Index

• Chapter 1 - Introduction to Algorithms
  • Binary Search (Python and C++)

[Source](https://www.google.com/url?sa=i&url=https%3A%2F%2Fwww.computerhope.com%2Fjargon%2Fb%2Fbinary-search.htm&psig=AOvVaw1zFTK0MlSB0fbDAuLT1Ztr&ust=1670503767029000&source=images&cd=vfe&ved=0CBAQjRxqFwoTCKi3qs_F5_sCFQAAAAAdAAAAABAE)

• Chapter 2 - Selection Sort
  • Arrays vs Linked Lists
  • Selection Sort Algorithm (Python and C++)

[Source](https://www.simplilearn.com/ice9/free_resources_article_thumb/Selection-Sort-Soni/what-is-selection-sort.png)

• Chapter 3 - Recursion

• Chapter 4 - Quicksort

[Souce](https://favtutor.com)

• Chapter 5 - Hash Tables

• Chapter 6 - Breadth-first Search

Souce

• Chapter 7 - Dijkstra's algorithm

Source

• Chapter 8 - Greedy algorithms

• Chapter 9 - Dynamic programming

  • Dynamic programming is useful when you’re trying to optimize something given a constraint.
  • You can use dynamic programming when the problem can be separated in discrete sub-problems which don't depend on each other.

• Chapter 10 - K-nearest neighbors

Source

• Chapter 11 - Where to go next

  • binary search tree data structure
  • Inverted indexes
  • The Fourier transform IMPORTANT TO READ!
  • Parallel algorithms
  • MapReduce
  • Bloom filters and HyperLogLog
  • The SHA algorithms
  • Locality-sensitive hashing
  • Diffie-Hellman key exchange
  • Linear programming