0x1B. C - Sorting algorithms & Big O

Learning Objectives

General

• 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

Requirements

• All files are created and compiled on Ubuntu 14.04.4 LTS on gcc 4.8.4 using the flags -Wall -Werror -Wextra and -pedantic
• All files are linted for syntax and style with Betty

0. Bubble sort

• Write a function that sorts an array of integers in ascending order using the Bubble sort algorithm

1. Insertion sort

• Write a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm

2. Selection sort

• Write a function that sorts an array of integers in ascending order using the Selection sort algorithm

3. Quick sort

• Write a function that sorts an array of integers in ascending order using the Quick sort algorithm

4. Shell sort - Knuth Sequence

• Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence

6. Counting sort

• Write a function that sorts an array of integers in ascending order using the Counting sort algorithm

7. Merge sort

• Write a function that sorts an array of integers in ascending order using the Merge sort algorithm

8. Heap sort

• Write a function that sorts an array of integers in ascending order using the Heap sort algorithm

9. Radix sort

• Write a function that sorts an array of integers in ascending order using the Radix sort algorithm

Authors

• Bob Deprizio - (https://github.com/BD20171998)
• Nehal Shastri - (https://github.com/nhlshstr)