https://github.com/amarquaye/sorting_algorithms
https://github.com/amarquaye/sorting_algorithms
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/amarquaye/sorting_algorithms
- Owner: amarquaye
- Created: 2023-06-27T13:36:08.000Z (almost 2 years ago)
- Default Branch: master
- Last Pushed: 2023-06-28T01:42:16.000Z (almost 2 years ago)
- Last Synced: 2025-01-11T04:44:21.782Z (5 months ago)
- Language: C
- Size: 10.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Sorting algorithms
## Files
All of the following programs are written in C:
| Filename | Description |
| -------- | ----------- |
| `0-bubble_sort.c` | Function that sorts an array of integers in ascending order using the **Bubble sort** algorithm |
| `0-O` | File that stores the best, average and worst case of the time complexity of the **Bubble sort** algorithm |
| `1-insertion_sort_list.c` | Function that sorts an array of integers in ascending order using the **Insertion sort** algorithm |
| `1-O` | File that stores the best, average and worst case of the time complexity of the **Insertion sort** algorithm |
| `2-selection_sort.c` | Function that sorts an array of integers in ascending order using the **Selection sort** algorithm |
| `2-O` | File that stores the best, average and worst case of the time complexity of the **Selection sort** algorithm |
| `3-quick_sort.c` | Function that sorts an array of integers in ascending order using the **Quick sort** algorithm |
| `3-O` | File that stores the best, average and worst case of the time complexity of the **Quick sort** algorithm |
| `100-shell_sort.c` | Function that sorts an array of integers in ascending order using the **Shell sort** algorithm |
| `100-O` | File that stores the best, average and worst case of the time complexity of the **Shell sort** algorithm |
| `101-cocktail_sort_list.c` | Function that sorts an array of integers in ascending order using the **Cocktail shaker sort** algorithm |
| `101-O` | File that stores the best, average and worst case of the time complexity of the **Cocktail shaker sort** algorithm |
| `102-counting_sort.c` | Function that sorts an array of integers in ascending order using the **Counting sort** algorithm |
| `102-O` | File that stores the best, average and worst case of the time complexity of the **Counting sort** algorithm |
| `103-merge_sort.c` | Function that sorts an array of integers in ascending order using the **Merge sort** algorithm |
| `103-O` | File that stores the best, average and worst case of the time complexity of the **Merge sort** algorithm |
| `104-heap_sort.c` | Function that sorts an array of integers in ascending order using the **Heap sort** algorithm |
| `104-O` | File that stores the best, average and worst case of the time complexity of the **Heap sort** algorithm |
| `105-radix_sort.c` | Function that sorts an array of integers in ascending order using the **Radix sort** algorithm |
| `105-O` | File that stores the best, average and worst case of the time complexity of the **Radix sort** algorithm |
| `106-bitonic_sort.c` | Function that sorts an array of integers in ascending order using the **Bitonic sort** algorithm |
| `106-O` | File that stores the best, average and worst case of the time complexity of the **Bitonic sort** algorithm |