Sorting: Divide and Conquer

Last time we learned that searching algorithms depend on the data being sorted. So we need to learn how to sort things efficiently.

Today we learned a few basic sorting algorithms for putting things in order. We tried putting paper bags at random weights in order of lightest to heaviest using a simple scale that compared the weight of two bags.

We learned that if we divide the problem in half repeatedly using a Quick sort  algorithm it was much more efficient than always finding the lightest bag which is called Selection sort.

We also had fun emptying the bags, but I am not sure where all the starbursts went?