Next book (and tutorial topic): Data Structures and Algorithms

programming
3

And…trigger pulled! :slight_smile: The plan is to have this done by June 2023. I’m still going back and forth on the TOC, but here is the tentative list:

  1. What makes this worth learning? (aka Why should you care?)
  2. Data Structures
    1. Arrays
    2. Hash Tables
    3. Set
    4. Linked Lists
    5. Stacks
    6. Queues
    7. Trees (Advanced - may skip)
      1. Binary
      2. Red-Black
      3. AVL
    8. Graphs:
      1. Directed
      2. Undirected
    9. Heaps
    10. Tries
  3. Algorithms
    1. Recursion
    2. Memoization
    3. Performance: Speed and Memory Considerations
    4. Searches
      1. Linear Search
      2. Binary Search
      3. Depth-First Search
      4. Breadth-First Search
    5. Sorts
      1. Selection
      2. Insertion
      3. Merge
      4. Bubble
      5. Quick
      6. Counting
      7. Radix
      8. Shell
    6. Shortest Distance (Djikstra) (Advanced - may skip)
    7. A* (Greedy) (Advanced - may skip)
  4. Popular Examples
    1. Towers of Hanoi
    2. Monty Hall Problem
    3. Square Matrix Rotation
    4. Caesar’s Cipher
    5. Rail Fence Cipher
    6. Hamming Distance
    7. Fisher-Yates Shuffle
    8. Best Time to Buy and Sell Stock
2 Likes