Algorithms

This repository contains implementations of various algorithms in Python.

Table of Contents

• Graph Algorithms
• Search Algorithms
• Sorting Algorithms

Graph Algorithms

• BreadthFirstSearch.py: This script contains an implementation of the breadth-first search algorithm for graphs.
• DepthFirstSearch.py: This script contains an implementation of the depth-first search algorithm for graphs.

Search Algorithms

• BinarySearch.py: This script contains an implementation of the binary search algorithm for sorted arrays.
• HashSearch.py: This script contains an implementation of the hash search algorithm using a hash table.
• InterpolationSearch.py: This script contains an implementation of the interpolation search algorithm for sorted arrays.
• LinearSearch.py: This script contains an implementation of the linear search algorithm for unsorted arrays.

Sorting Algorithms

Comparison-based Sorting Algorithms

• BubbleSort.py: This script contains an implementation of the bubble sort algorithm.
• HeapSort.py: This script contains an implementation of the heap sort algorithm.
• InsertionSort.py: This script contains an implementation of the insertion sort algorithm.
• MergeSort.py: This script contains an implementation of the merge sort algorithm.
• QuickSort.py: This script contains an implementation of the quick sort algorithm.
• SelectionSort.py: This script contains an implementation of the selection sort algorithm.

Non-comparison-based Sorting Algorithms

• BucketSort.py: This script contains an implementation of the bucket sort algorithm.
• CountingSort.py: This script contains an implementation of the counting sort algorithm.
• RadixSort.py: This script contains an implementation of the radix sort algorithm.

Feel free to use these scripts as a reference or incorporate them into your own projects. If you find any bugs or have suggestions for improvements, please feel free to open an issue or submit a pull request.

Licence

MIT