Algorithms and Data StructuresDr. Andreas NüchterSeptember 24, 2009191Announcements•Oct 15. midterm (here in class)
Algorithms and Data StructuresDr. Andreas NüchterSeptember 24, 2009192Last Lecture – Advanced Sorting MethodsMerge sortis based on the divide and conquertechnique. Idea: Divide the keys which have to be sorted into two halves of equal size (divide step):Sort the two halves recursively and exploit in the merging step that the two halves are sorted. The merging step can be performed in linear time (conquer step).
has intentionally blurred sections.
Sign up to view the full version.