SORTING ALGORITHMS & BIG O

Description

Here's a breakdown of what you can learn from this project:

• Discover at least four different sorting algorithms.
• Understand the concept of Big O notation and how to assess the time complexity of an algorithm.
• Learn how to select the most appropriate sorting algorithm for a given input.
• Understand what a stable sorting algorithm entails.

---

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

5. Cocktail shaker sort

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

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 Quick sort algorithm

---

Author

Besthor Igbe

• Kindly consider following me on GitHub Besthor