https://github.com/major0001/sorting_algorithms
C/ Algorithm /Data structure
https://github.com/major0001/sorting_algorithms
Last synced: 3 months ago
JSON representation
C/ Algorithm /Data structure
- Host: GitHub
- URL: https://github.com/major0001/sorting_algorithms
- Owner: major0001
- Created: 2022-10-12T02:39:25.000Z (over 2 years ago)
- Default Branch: master
- Last Pushed: 2022-10-12T02:57:31.000Z (over 2 years ago)
- Last Synced: 2024-12-25T11:37:55.265Z (4 months ago)
- Language: C
- Size: 11.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# C - Sorting algorithms & Big O
In this project, I implemented several different sorting algorithms.### Tests
- tests: Folder of test files.
### Helper Files raised_hands
- print_array.c: C function that prints an array of integers.
- print_list.c: C function that prints a listint_t doubly-linked list.
### Header Files file_folder
sort.h: Header file containing definitions and prototypes for all types and functions written for the project.
Data Structure:typedef struct listint_s
{
const int n;
struct listint_s *prev;
struct listint_s *next;
} listint_t;
Function Prototypes:| File | Prototype |
| --- | --- |
| print_array.c | void print_array(const int *array, size_t size) |
| print_list.c | void print_list(const listint_t *list) |
| 0-bubble_sort.c | void bubble_sort(int *array, size_t size); |
| 1-insertion_sort_list.c | void insertion_sort_list(listint_t **list); |
| 2-selection-sort.c | void selection_sort(int *array, size_t size); |
| 3-quick_sort.c | void quick_sort(int *array, size_t size); |
| 100-shell_sort.c | void shell_sort(int *array, size_t size); |
| 101-cocktail_sort_list.c | void cocktail_sort_list(listint_t **list); |
| 102-counting_sort.c | void counting_sort(int *array, size_t size); |
| 103-merge_sort.c | void merge_sort(int *array, size_t size); |
| 104-heap_sort.c | void heap_sort(int *array, size_t size); |
| 105-radix_sort.c | void radix_sort(int *array, size_t size); |
| 106-bitonic_sort.c | void bitonic_sort(int *array, size_t size); |
| 107-quick_sort_hoare.c | void quick_sort_hoare(int *array, size_t size); |