Search and Sort Algorithm Implementation

This is a repository for algorithm learning. Hopefully it can help you along your way towards mastering algorithms. Please refer to interactivepython for the details of search and sort algorithm in Python. Apart from Python, Julia version is also included.

Note that search and sort algorithms in Graph ADT, including Breath First Search, Depth First Search, A_Star Search and Topological Sort, are in a repository called Graph Theory.

Search

1. Sequential Search (Julia, Python)

2. Binary Search (Julia, Python)

3. Hash Search with Hash Chaining, Linear Probing & Quadratic Probing (Julia, Python)

4. Rabin-Karp Search (Julia, Python)

5. Bloom Filter Search with Fowler–Noll–Vo-1 Hash & Jenkins One-at-a-time Hash (Julia, Python)

6. Knuth-Morris-Pratt Search (Julia, Python)

7. Boyer–Moore Search (Julia, Python)

8. Aho–Corasick Search (Julia, Python)

Sort

1. Bubble Sort (Julia, Python)

2. Selection Sort (Julia, Python)

3. Insertion Sort (Julia, Python)

4. Shell Sort (Julia, Python)

5. Merge Sort (Julia, Python)

6. Quick Sort (Julia, Python)

7. Radix Sort (Julia, Python)

8. Counting Sort (Julia, Python)

9. Heap Sort (Julia, Python)

10. Bogo Sort (Julia, Python)

11. Gnome Sort (Julia, Python)

12. Bitonic Sort (Julia, Python)

13. Shaker Sort (Julia, Python)