Algorithms for fun

Algorithms is fascinating.
Keep it simple and stupid, but not simpler.

Combinatorial

• Permutation
• Combination

Computational geometry

• Convex hull
• Triangulation

Data Structure

• Linked list
  • Merge sort
• Tree
  • Self-balancing binary search tree
    • AVL Tree
    • Red–black tree
  • Heap
    • Binary heap
    • Binomial heap
    • Fibonacci heap
  • Trie
    • Suffix tree
  • Fenwick tree
• Graph
• Hash table
• Disjoint-set
• Suffix array

Graph

• Minimum spanning tree
• Shortest path problem
• Knight's tour
• Traveling salesman problem (TSP)
• Network flow problem

Numeric

• Big integer
• Prime number
• Fast Fourier transform

Optimization

• Dynamic programming
• Linear programming
• Metaheuristics

Search

• Hashing
• Pathfinding
  • Breadth-first search
  • Depth-first search
  • A*(A-star) search algorithm
  • IDA*(Iterative deepening A-star)

Sorting

• Exchange sorts
  • Bubble sort
  • Cocktail sort
  • Quicksort
• Selection sorts
  • Selection sort
  • Heap sort
  • Smoothsort
• Insertion sorts
  • Insertion sort
  • Shellsort
• Merge sorts
  • Merge sort
• Distribution sorts
  • Radix sort
• Hybrid sorts
  • Introsort
  • Timsort

String

• Palindrome
• Matching

License

The MIT License