Partition the range 2 sort each partition examines

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: f Recursively sorting each half Merging the sorted halves O( n log (n) ) Notes Faster than the selection sort • Divide and conquer 1. Partition the range 2. Sort each partition Examines all values in an array until it finds a match or reaches the end...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online