![]() |
![]() |
![]() |
![]() |
![]() | |
![]() |
![]() | ||||
![]() | ![]() | ![]() | ![]() |
In this lesson, you will learn about three sorting algorithms: bubble, selection, and insertion. You are responsible for knowing how they work, but you do not necessarily need to memorize and reproduce the code. After counting the number of steps of each algorithm, you will have a relative sense of which is the fastest and the slowest sorting algorithm. The key topics for this lesson are:
|
![]() | ![]() | ![]() | ![]() | ||
![]() |
|
|
|