Videos

4:41 sorting algorithms merge sort

sorting algorithms merge sort

00:41 bubble sorting method

bubble sorting method

00:40 selection sorting method

selection sorting method

00:20 Insertion Sorting Method

Insertion Sorting Method

1:19 merge sorting assessment

merge sorting assessment

1:00 sorting assessments

sorting assessments

2:43 sorting assessments

sorting assessments

00:37 sorting methods

sorting methods

2:14 drone video day 4

drone video day 4 where students use equations to code their drone flight paths
video edited by Angel Acosta

00:19 Insertion Sorting Method

Insertion Sorting Method

00:30 Insertion Sorting Method

Insertion Sorting Method

00:29 Insertion Sorting Method

We can think of an insertion sort also as a "pull-and-bubble" procedure. We pull a number out of the unsorted list and "bubble" it through the sorted list: we compare the red number with the black numbers one by one and swap them if they're in the wrong spots. We stop bubbling when the numbers we compare are in the right positions relative to each other.

This algorithm is called insertion sort because it takes a number and inserts it into the correct position in the sorted list.