{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Algorithms_and_Data_Structures_07

# Algorithms_and_Data_Structures_07 - Lecture 7 Computer...

This preview shows pages 1–11. Sign up to view the full content.

Computer Science Algorithms and Data Structures Prof. Dr. Andreas Nüchter Research I, Room 105 Jacobs University Bremen http://www.nuechti.de [email protected] Lecture 7

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Algorithms and Data Structures Dr. Andreas Nüchter September 24, 2009 191 Announcements Oct 15. midterm (here in class)
Algorithms and Data Structures Dr. Andreas Nüchter September 24, 2009 192 Last Lecture – Advanced Sorting Methods Merge sort is based on the divide and conquer technique. 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 ).

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document