0x1B. C - Sorting algorithms & Big O 💻

Introduction 🔍

A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements.

---

---

Projects 📂

1. bubble_sort
2. insertion_sort_list
3. quick_sort

Type algorithms 👾

• Selection Sort.
• Bubble Sort.
• Recursive Bubble Sort.

Requirements

• Ubuntu 14.04 LTS
• MacOs/Windows OS
• General
• Allowed editors: vi, vim, emacs
• All your files will be compiled on Ubuntu 14.04 LTS
• 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
• No more than 5 functions per file

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

Installation 🔧

In your terminal, git clone the directory with the following command:

git clone https://github.com/vickky9ice/[Github project directory]

$ git clone https://github.com/vickky9ice/sorting_algorithms.git
$ cd sorting algorithms
$ used gcc -Wall -Wextra -Werror -pedantic (file)-main.c..

Author

Adeboye Victor Oyekanmi