The goal of this project is to explain how algorithms work. The focus is on clarity and readability of the code, not on making a reusable library that you can drop into your own projects. That said, most of the code should be ready for production use but you may need to tweak it to fit into your own codebase.
- Linear Search
- Binary Search
- Count Occurrences
- Select Minimum / Maximum
- k-th Largest Element
- Interpolation Search
- Jump Search
Basic sorts:
Fast sorts:
Special-purpose sorts:
- Stack. Last-in, first-out!
Abhimanyu Sharma | Harsh Vishwakarma
Want to help us out? Read the guidelines for contributing to go-algorightms.
Written by brotherpowers