0x1B. C - Sorting algorithms & Big O

Description

Table of contents

Files	Description
.gitignore	Ignore test files
sort.h	Header file
0-bubble_sort.c	Function that sorts an array of integers in ascending order using the Bubble sort algorithm Prototype: void bubble_sort(int *array, size_t size)
1-insertion_sort_list.c	Function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm Prototype: void insertion_sort_list(listint_t **list);
2-selection_sort.c	Function that sorts an array of integers in ascending order using the Selection sort algorithm Prototype: void selection_sort(int *array, size_t size);
3-quick_sort.c	Function that sorts an array of integers in ascending order using the Quick sort algorithm Prototype: void quick_sort(int *array, size_t size);
100-shell_sort.c	Function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence Prototype: void shell_sort(int *array, size_t size);
101-cocktail_sort_list.c	function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm Prototype: void cocktail_sort_list(listint_t **list);
102-counting_sort.c	Function that sorts an array of integers in ascending order using the Counting sort algorithm Prototype: void counting_sort(int *array, size_t size);
103-merge_sort.c	Function that sorts an array of integers in ascending order using the Merge sort algorithm Prototype: void merge_sort(int *array, size_t size);
104-heap_sort.c	Function that sorts an array of integers in ascending order using the Heap sort algorithm Prototype: void heap_sort(int *array, size_t size);
105-radix_sort.c	Function that sorts an array of integers in ascending order using the Radix sort algorithm Prototype: void radix_sort(int *array, size_t size);
106-bitonic_sort.c	Function that sorts an array of integers in ascending order using the Bitonic sort algorithm Prototype: void bitonic_sort(int *array, size_t size);
107-quick_sort_hoare.c	Function that sorts an array of integers in ascending order using the Quick sort algorithm Prototype: void quick_sort_hoare(int *array, size_t size);
1000-sort_deck.c	Function that sorts a deck of cards. Prototype: void sort_deck(deck_node_t **deck);
deck.h	Header file for task 12. Dealer

Resources

• Sorting algorithm
• Big O notation
• Sorting algorithms animations
• 15 sorting algorithms in 6 minutes