上浒充通大学 Merging SHANGHAI JIAO TONG UNIVERSITY Merging.Combine two pre-sorted lists into a sorted whole. How to merge efficiently? Linear number of comparisons. ·Use temporary array. R H工M S T A G H I Challenge for the bored.In-place merge.[Kronrud,1969] using only a constant amount of extra storage7 Merging Merging. Combine two pre-sorted lists into a sorted whole. How to merge efficiently? • Linear number of comparisons. • Use temporary array. Challenge for the bored. In-place merge. [Kronrud, 1969] A G L O R H I M S T A G H I using only a constant amount of extra storage