Week 6

Question 1

what does the bubble sorting algorithm do

Answer 1

walk through an entire array and compare each adjacent pair. if they are out of order, swap their positions. keep doing this until the entire array is sorted

Question 2

what does the insertion sort do?

Answer 2

divide an array into sorted and unsorted, pick and remove a value from the unsorted side and insert it into the correct place in the sorted array, repeated this until the unsorted is empty and the sorted is full