Example implementations to learn algorithms

• Written in TypeScript with Deno
• 🧹 Simple, elegant and readable
• 🕵️‍♀️ Event-trackable
• ⛑ Well tested
• 👾 No micro optimization

Implementations

Data structure

• Doubly linked list (Wikipedia)
• Singly linked list (Wikipedia)
• Circular linked list (Wikipedia)
• Binary search tree (Wikipedia)
• Hash table (Wikipedia)

Searching

• Linear search (Wikipedia)
• Binary search (Wikipedia)

Sorting

• Exchanging
  • Bubble sort (Wikipedia)
  • Comb sort (Wikipedia)
  • Cocktail shaker sort (Wikipedia)
• Selection
  • Selection sort (Wikipedia)
  • Heap sort (Wikipedia)
• Insertion
  • Insertion sort (Wikipedia)
  • Shell sort (Wikipedia)
  • Binary tree sort (Wikipedia)
  • Library sort (Wikipedia)
• Other
  • Merge sort (Wikipedia)
  • Quick sort (Wikipedia)

Lossless compression

• Run-length encoding (Wikipedia)
• Huffman coding (Wikipedia)
• Prediction by partial matching (Wikipedia)

Matching

Path detection

Puzzles

• Water pouring (Wikipedia)

Other

• Euclidean algorithm (Wikipedia)
• Sieve of Eratosthenes (Wikipedia)

Contributing

🙅‍♀️ DO NOT CONTRIBUTE TO THIS REPOSITORY. This repository is for my learning.

License

MIT