Merging - PowerPoint PPT Presentation

lemuel
merging n.
Skip this Video
Loading SlideShow in 5 Seconds..
Merging PowerPoint Presentation
play fullscreen
1 / 11
Download Presentation
Merging
129 Views
Download Presentation

Merging

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. A G L O R Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. H I M S T A auxiliary array

  2. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G auxiliary array

  3. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H auxiliary array

  4. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I auxiliary array

  5. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L auxiliary array

  6. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L M auxiliary array

  7. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L M O auxiliary array

  8. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L M O R auxiliary array

  9. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L M O R S auxiliary array

  10. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L M O R S T auxiliary array

  11. Merging • Merge. • Keep track of smallest element in each sorted half. • Insert smallest of two elements into auxiliary array. • Repeat until done. A G L O R H I M S T A G H I L M O R S T