Share Description
In this course you will :
- Learn about bubble sort, an introductory sorting algorithm that iterates through a list and compares pairings of adjacent elements
- Learn about merge sort, a divide-and-conquer algorithm, which breaks items into smaller elements until sorting them becomes really simple
- Learn about quicksort, an efficient recursive algorithm for sorting arrays or lists of values
Learn about radix sort, an algorithm that operates on numbers digit by digit
