*This preview shows
page 1. Sign up
to
view the full content.*

**Unformatted text preview: **4. Try the solution strategy "by hand". 5. Implement the solution strategy (write the code). 6. Run test cases. 7. Run the code. Apply steps 1-4 to the two problems below. Be sure to consider each step in the solution strategy; don’t take anything for granted! Do not refer to software or standard sorting algorithms (you’re not expected to know these yet). 1. You are teaching a class and want to break the class into groups of 4 for a project. How will you assign the students to groups? 2. Develop an algorithm that takes a list of integers and reorders them so that the smallest number is first, the largest number is second, the next-to-smallest is third, the next-to-largest is fourth, and so on. If the original list contained [5, 8, 12, 10, 2, 7, 4], after applying your algorithm, the list would contain [2, 12, 4, 10, 5, 8, 7]....

View
Full
Document