COMP 2011 Data Structures Lecture 6
Show AI Simplified Slide
What is this slide about?
Explain the divide and conquer steps
Step ①: Partition a into two parts
Step ②: Find each part's max
Step ③: Compare and return the larger
Base case: only one element
Finding a minimum is similar — how?
Explain this tournament tree
How do I write the code?
Page 7 / 32
