Raven sets up a Sort-Off. "Sort a small pile. Then mix it up and use a different plan," she says.
Rocket sorts his socks once. Then he tries a new way. "The second way was faster!" he says.
Nova hides a toy in a sorted line of eight things. "Try checking the middle first," she says. Let's help them run their own Sort-Off.
Find a small pile (10 books? 8 socks? 6 toys?). Time yourself sorting them.
Then RE-MIX and try a DIFFERENT algorithm.
Hide a small toy in a sorted line of 8 things. Can a friend find it
FASTER by checking the MIDDLE first (binary)?
| Statement | True or false? |
|---|---|
| Many algorithms can solve the same problem. | ? |
| Linear search looks at every item until it finds the one. | ? |
| Bubble it up stops when no swaps happen. | ? |
| An algorithm can never be improved. | ? |
Week 8: ABSTRACTION. Keeping the BIG idea, hiding small details.