0x1B. C - Sorting algorithms & Big O

Resources:books:

Read or watch:
* Big-O Algorithm Complexity Cheat
* Big O Notation - Ruby Reilly
* Big O Notation: A primer for beginning devs
* Complete Beginner's Guide to Big O Notation
* Data Structures - Asymptotic Analysis
* RANDOM.ORG - Integer Set Generator
* Sorting algorithm
* algorithm - What is a plain English explanation of "Big O" notation?
* What is the time complexity of indexing, inserting and removing from common data structures?
* Sorting Algorithms Animations
* Sorting Algorithms BigPicture
* algoritmos de ordenamiento
* ALGORITMOS - METODOS DE ORDENAMIENTO
* ¿Qué es la complejidad algorítmica y con qué se come?
* Big O notation
* Análisis de la complejidad de los algoritmos
* Rendimiento de algoritmos y notación Big-O
* Big-O is easy to calculate, if you know how
* 8 time complexities that every programmer should know

Learning Objectives:bulb:

What you should learn from this project:

• 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

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

9. Radix sort

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

10. Bitonic sort

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

11. Quick Sort - Hoare Partition scheme

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

12. Dealer

• Write a function that sorts a deck of cards.

Author

• Juan Pablo Yepes Tamayo
• GitHub
• Linkedin

• Twitter

• Angello Villegas

• GitHub
• Linkedin
• Twitter