|
| 1 | +# Project: 0x1B. C - Sorting algorithms & Big O |
| 2 | + |
| 3 | +## Resources |
| 4 | + |
| 5 | +#### Read or watch: |
| 6 | + |
| 7 | +* [Sorting algorithm](https://intranet.alxswe.com/rltoken/-j5MKLBlzZAC2RfJ5DTBIg) |
| 8 | +* [Big O notation](https://intranet.alxswe.com/rltoken/WRvrE2BaNVQFssHiUATTrw) |
| 9 | +* [Sorting algorithms animations](https://intranet.alxswe.com/rltoken/ol0P7NbYVb5R31iOv4Q40A) |
| 10 | +* [15 sorting algorithms in 6 minutes](https://intranet.alxswe.com/rltoken/_I0aEvhfJ66Xyob6dd9Utw) |
| 11 | +* [CS50 Algorithms explanation in detail by David Malan](https://intranet.alxswe.com/rltoken/Ea93HeEYuNkOL7sGb6zzGg) |
| 12 | +* [All about sorting algorithms](https://intranet.alxswe.com/rltoken/21X_eaj5RGcLIL9mZv2sqw) |
| 13 | +## Learning Objectives |
| 14 | + |
| 15 | +### General |
| 16 | + |
| 17 | +* At least four different sorting algorithms |
| 18 | +* What is the Big O notation, and how to evaluate the time complexity of an algorithm |
| 19 | +* How to select the best sorting algorithm for a given input |
| 20 | +* What is a stable sorting algorithm |
| 21 | +## Tasks |
| 22 | + |
| 23 | +| Task | File | |
| 24 | +| ---- | ---- | |
| 25 | +| 0. Bubble sort | [SOON](./) | |
| 26 | +| 1. Insertion sort | [SOON](./) | |
| 27 | +| 2. Selection sort | [SOON](./) | |
| 28 | +| 3. Quick sort | [SOON](./) | |
| 29 | +| 4. Shell sort - Knuth Sequence | [SOON](./) | |
| 30 | +| 5. Cocktail shaker sort | [SOON](./) | |
| 31 | +| 6. Counting sort | [SOON](./) | |
| 32 | +| 7. Merge sort | [SOON](./) | |
| 33 | +| 8. Heap sort | [SOON](./) | |
| 34 | +| 9. Radix sort | [SOON](./) | |
| 35 | +| 10. Bitonic sort | [SOON](./) | |
| 36 | +| 11. Quick Sort - Hoare Partition scheme | [SOON](./) | |
| 37 | +| 12. Dealer | [SOON](./) | |
| 38 | + |
0 commit comments