





variable_example.sb 
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? 
Each card represents a binary digit that can be a 1 or a 0. The card is a 1 if the dots are showing and the card is a 0 if they are hidden. To convert a binary number to regular numbers just add up all the dots. Examples: 00000 > 0 + 0 + 0 + 0 +0 = 0 00001 > 0 + 0 + 0 + 0 + 1 = 1 01010 > 0 + 8 + 0 + 2 + 0 = 10 10100 > 16 + 0 + 4 + 0 + 0 = 20 11111 > 16 + 8 + 4 + 2 + 0 = 31 We also did a magic trick where I read peoples minds, if you want to make the cards to impress your friends at dinner parties here is the instructions Then we learned how to count binary on our fingers (be careful not to be rude).  Counting to ten in binary: 1 10 11 100 101 110 111 1000 1001 1010 