Computer Science Unplugged
Divide and Conquer—Santa’s Dirty Socks
The story "Santa's Dirty Socks" provides learners an example of a search algorithm that uses a divide and conquer system similar to a binary search algorithm. The included questions expand upon the concepts that follow the story.
Computer Science Unplugged
Lightest and Heaviest—Sorting Algorithms
How do computers sort data lists? Using eight unknown weights and a balance scale, groups determine the order of the weights from lightest to heaviest. A second worksheet provides the groups with other methods to order the weights. The...
TryEngineering
Recursion: Smaller Sibling Pyramids
Get siblings to do your work. Scholars learn how to perform summations of arithmetic sequences in an innovative lesson plan. They use iterations, smaller siblings (tail-end recursion), and the divide-and-conquer approach.
Computer Science Unplugged
Tourist Town—Dominating Sets
As an introduction to using a network to determine the fewest number of nodes that meet a given condition, small groups work together to determine the fewest number of ice cream vans, and their locations, to be able to serve the people...
Other popular searches
- Standard Division Algorithm
- Long Division Algorithm
- Division Algorithm Estimate
- 4th Grade Division Algorithm
- Division Algorithm Lessons