This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 auxiliary array smallest smallest A G L O R H I M S T Merging Merge. ■ Keep track of smallest element in each sorted half. ■ I nsert smallest of two elements into auxiliary array. ■ Repeat until done. A 2 auxiliary array smallest smallest A G L O R H I M S T A Merging Merge. ■ Keep track of smallest element in each sorted half. ■ I nsert smallest of two elements into auxiliary array. ■ Repeat until done. G 3 auxiliary array smallest smallest A G L O R H I M S T A G Merging Merge. ■ Keep track of smallest element in each sorted half. ■ I nsert smallest of two elements into auxiliary array. ■ Repeat until done. H 4 auxiliary array smallest smallest A G L O R H I M S T A G H Merging Merge. ■ Keep track of smallest element in each sorted half. ■ I nsert smallest of two elements into auxiliary array. ■ Repeat until done. I 5 auxiliary array smallest smallest A G L O R H I M S T A G H I Merging Merge....
View
Full
Document
This note was uploaded on 02/23/2012 for the course COMP 553 taught by Professor Ajay during the Spring '12 term at Ill. Chicago.
 Spring '12
 Ajay
 Sort

Click to edit the document details