README.md

Collection of Algorithms

Simple standalone implementations of algorithms in Zig

Table of Contents

• About
• Prerequisite
• Running
• Testing
• Algorithms
  • Search Trees
  • Sorting
• Contributing
• License

About

The purpose of this project is to provide example implementations of algorithms with minimal dependencies for educational use. The algorithms implemented here are meant to be easy to run and try out to support reviewing, discovering and gaining a deeper understanding of the algorithms showcased in this repository. Optimizations are applied to implementations if they either make the implementation easier to understand or highlight the essence of the algorithm well.

Prerequisite

• Zig 0.11+

Running

zig build bubble_sort

Use zig build --help to see other available algorithms.

Testing

Heap sort:

zig test sorting/heap_sort.zig --main-pkg-path .

Everything else:

zig test <path_to_algorithm>.zig

🔨 Algorithms

Search Trees

• B-tree search
• Binary search tree
• Left-leaning red-black tree
• Trie

Sorting

• Bubble sort
• Heap sort
• Insertion sort
• Merge sort
• Quicksort
• Radix sort