Video Gallery
Insertion Sorting Method
Go HD
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.
Listed in Computer Science Department
-
1:32
A Dream Deferred Read By Langston Hughes
Uploaded Dec 20, 2017 to Library
-
4:30
Jury Nullification: The Law You Won't Be Told
From https://www.youtube.com/watch?v=uqH_Y1TupoQ
Uploaded Dec 21, 2017 to Library -
2:56
Apartheid Explained
Uploaded Apr 20, 2018 to Library
-
5:55
Characterization - TED Ed
This video will introduce you to some of the ways writers and readers analyze and create characters.
Uploaded Dec 22, 2017 to English Department -
4:03
The History of Apartheid
Uploaded Apr 20, 2018 to Library
