0x1B. C - Sorting algorithms & Big O

Introduction

This repo is about sorting algorithms and their big O notations (best case, average case, worst case) through C language and <NUMBER>-O file

Bubble sort

Sort an array of integers in ascending order using the Bubble sort algorithm

• Files: 0-bubble_sort.c and 0-O

Insertion sort

Sort a doubly linked list of integers in ascending order using the Insertion sort algorithm

• Files: 1-insertion_sort_list.c and 1-O

Selection sort

Sort an array of integers in ascending order using the Selection sort algorithm

• Files: 2-selection_sort.c and 2-O

Quick sort

Sort an array of integers in ascending order using the Quick sort algorithm

• Files: 3-quick_sort.c and 3-O

Shell sort - Knuth Sequence

Sort an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence

• Files: 100-shell_sort.c

Cocktail shaker sort

Sort a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm.

• Files: 101-cocktail_sort_list.c and 101-O

Counting sort

Sort an array of integers in ascending order using the Counting sort algorithm.

• Files: 102-counting_sort.c and 102-O

Merge sort

Sort an array of integers in ascending order using the Merge sort algorithm.

• Files: 103-merge_sort.c and 103-O

Heap sort

Sort an array of integers in ascending order using the Heap sort algorithm.

• Files: 104-heap_sort.c and 104-O

Radix sort

Sort an array of integers in ascending order using the Radix sort algorithm.

• Files: 105-radix_sort.c

Bitonic sort

Sort an array of integers in ascending order using the Bitonic sort algorithm.

• Files: 106-bitonic_sort.c and 106-O

Quick Sort - Hoare Partition scheme

Sort an array of integers in ascending order using the Quick sort algorithm

• Files: 107-quick_sort_hoare.c and 107-O

Dealer

A function that sorts a deck of cards

• Files: 1000-sort_deck.c, deck.h