This collection features a variety of sorting algorithms implemented in C, designed for clarity and efficiency.
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Quick Sort (Hoare partition)
- Shell Sort
- Cocktail Sort
- Counting Sort
- Merge Sort
- Heap Sort
- Radix Sort
- Bitonic Sort
- Deck Sort (a specialized algorithm for sorting deck cards)
Each sorting algorithm is implemented in its own file, ensuring clear and maintainable code.
Test files are also included to validate the functionality and performance of each algorithm.
These implementations can be used as a reference or a starting point for projects requiring efficient data sorting in C.
- Clone the repository:
git clone https://github.com/uosyph/sorting_algorithms.git
cd sorting_algorithms
- Compile any sorting algorithm:
gcc -o sort_algorithm sort_algorithm.c
- Run the compiled program:
./sort_algorithm