algorithms.md

Algorithms and Data Structures List

List of algorithms and code examples in the book.

Chapter 1. Basics

1.1 Ideas

• Max of three numbers

Chapter 2: Complexity

2.1 Counting Time

• Selection Sort

Chapter 3. Strategy

3.1 Iteration

• Merge two sorted arrays
• Power Set - Iterative

3.2 Recursion

• nth Fibonacci
• Palindrome
• Power Set - Recursive

3.3 Brute Force

• Best Trade - Brute Force
• Knapsack - Brute Force

3.4 Backtracking

• 8 Queens Puzzle
• 8 Queens Puzzle (OO Version)

3.5 Heuristics

• Greedy Knapsack

3.6 Divide and Conquer

• Merge Sort
• Best Trade - Divide and Conquer
• Knapsack - Divide and Conquer
• Knapsack - Divide and Conquer (My approach)

3.7 Dynamic Programming

• Fibonacci - DP
• Knapsack - DP
• Best Trade - DP (Bottom-Up)

3.8 Branch and Bound

• Powdered Knapsack - Heuristics
• TODO: Knapsack - Branch and Bound

Chapter 4. Data

4.2 Common Abstractions

• The Stack
• The Queue
• The Priority Queue
• The List
• The Sorted List
• The Map
• The Set

4.3 Data Structures

• The Array (MDN)
• The Linked List
• The Doubly Linked List
• The Tree
• The Binary Search Tree
• The Binary Heap
• The Graph
• The Hash Table

Chapter 5. Algorithms

Chapter 6. Databases

Chapter 7. Computers

Chapter 8. Programming