Simple Sorting

Question 1

Define

Bubble Sort

Answer 1

Compare two array values. If one on the left is greater, swap them. Move one position to right.
Swaps and comparisons O(N^2), slow

Question 2

Define

Selection Sort

Answer 2

Goes through whole list and identifies shortest, swaps that value with position 0’s value. Next move smallest to position 1, etc.
Swaps O(N)
Comparisions O(N^2)

Question 3

Define

Insertion Sort

Answer 3

O(N^2) time.
Twice as fast as bubble sort
Often used as the final stage of more sophisticated sorts.
Takes the next unsorted variable and inserts into the appropriate position amongst the already sorted.