{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Algorithms_and_Data_Structures_07

Algorithms_and_Data_Structures_07 - Lecture 7 Computer...

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

View Full Document Right Arrow Icon
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
Background image of page 1

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

View Full Document Right Arrow Icon
Algorithms and Data Structures Dr. Andreas Nüchter September 24, 2009 191 Announcements Oct 15. midterm (here in class)
Background image of page 2
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 ).
Background image of page 3

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

View Full Document Right Arrow Icon