0x1B. C - Sorting algorithms & Big O

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

The goal of this project are as follows:

Writing at least four different sorting algorithms
What is the Big O notation and how o evaluate the
time complexity of an algorithm
How to select the best sorting algorithm
What is a stable algorithm

Allowed editors: vi, vim, emacs
All your files will be compiled on Ubuntu 14.04 LTS
Your programs and functions will be compiled with gcc 4.8.4
using the flags -Wall -Werror -Wextra and -pedantic
All your files should end with a new line
A README.md file, at the root of the folder of the project, is mandatory
Your code should use the Betty style. It will be checked using betty-style.pl and betty-doc.pl
You are not allowed to use global variables
No more than 5 functions per file
Unless specified otherwise, you are not allowed to use the standard
library. Any use of functions like printf, puts, … is totally forbidden.
In the following examples, the main.c files are shown as examples. You
can use them to test your functions, but you don’t have to push them to
your repo (if you do we won’t take them into account). We will use our own
main.c files at compilation. Our main.c files might be different from the
one shown in the examples
The prototypes of all your functions should be included in your header
file called sort.h
Don’t forget to push your header file
All your header files should be include guarded
A list/array does not need to be sorted if its size is less than 2.

Foundations - Low-level programming & Algorithm ― Data structures and Algorithms

by Alexandre Gautier, Software Engineer at Holberton, Inc.

Name		Name	Last commit message	Last commit date
Latest commit History 54 Commits
0-O		0-O
0-bubble_sort.c		0-bubble_sort.c
0-main.c		0-main.c
1-O		1-O
1-insertion_sort_list.c		1-insertion_sort_list.c
1-main.c		1-main.c
100-shell_sort.c		100-shell_sort.c
101-O		101-O
101-cocktail_sort_list.c		101-cocktail_sort_list.c
101-main.c		101-main.c
102-O		102-O
102-counting_sort.c		102-counting_sort.c
102-main.c		102-main.c
103-O		103-O
103-main.c		103-main.c
103-merge_sort.c		103-merge_sort.c
104-O		104-O
104-heap_sort.c		104-heap_sort.c
104-main.c		104-main.c
105-O		105-O
105-main.c		105-main.c
105-radix_sort.c		105-radix_sort.c
106-O		106-O
106-bitonic_sort.c		106-bitonic_sort.c
106-main.c		106-main.c
107-O		107-O
107-main.c		107-main.c
107-quick_sort_hoare.c		107-quick_sort_hoare.c
2-O		2-O
2-main.c		2-main.c
2-selection_sort.c		2-selection_sort.c
3-O		3-O
3-main.c		3-main.c
3-quick_sort.c		3-quick_sort.c
README.md		README.md
bitonic		bitonic
bubble		bubble
cocktail		cocktail
counting		counting
heap		heap
insertion		insertion
merge		merge
print_array.c		print_array.c
print_list.c		print_list.c
quick		quick
radix		radix
select		select
sort.h		sort.h

Zineb112/sorting_algorithms