https://github.com/polymathuniversata/sorting_algorithms
https://github.com/polymathuniversata/sorting_algorithms
Last synced: about 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/polymathuniversata/sorting_algorithms
- Owner: polymathuniversata
- Created: 2024-02-25T02:26:05.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-02-25T02:27:43.000Z (over 2 years ago)
- Last Synced: 2025-05-31T22:09:36.025Z (about 1 year ago)
- Language: C
- Size: 9.77 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 0x1B. C - Sorting algorithms & Big O
## Description
What you should learn from this project:
* At least four different sorting algorithms
* What is the Big O notation, and how to evaluate the time complexity of an algorithm
* How to select the best sorting algorithm for a given input
* What is a stable sorting algorithm
---
### [0. Bubble sort](./0-bubble_sort.c)
*
### [1. Insertion sort](./1-insertion_sort_list.c)
*
### [2. Selection sort](./2-selection_sort.c)
*
### [3. Quick sort](./3-quick_sort.c)
* Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
### [4. Shell sort - Knuth Sequence](./100-shell_sort.c)
* Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence
### [5. Cocktail shaker sort](./101-cocktail_sort_list.c)
* Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm
### [6. Counting sort](./102-counting_sort.c)
* Write a function that sorts an array of integers in ascending order using the Counting sort algorithm
### [7. Merge sort](./103-merge_sort.c)
* Write a function that sorts an array of integers in ascending order using the Merge sort algorithm
### [8. Heap sort](./104-heap_sort.c)
* Write a function that sorts an array of integers in ascending order using the Heap sort algorithm
### [9. Radix sort](./105-radix_sort.c)
* Write a function that sorts an array of integers in ascending order using the Radix sort algorithm
### [10. Bitonic sort](./106-bitonic_sort.c)
* Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm
### [11. Quick Sort - Hoare Partition scheme](./107-quick_sort_hoare.c)
* Write a function that sorts an array of integers in ascending order using the Quick sort algorithm
### [12. Dealer](./1000-sort_deck.c)
*
---
## Author
* **Polymath Universata** - [Polymath Universata](https://github.com/polymathuniversata)# sorting_algorithms
# sorting_algorithms