UNIT 5C Merge Sort - CMU School of Computer Science
UNIT 5C Merge Sort
15110 Principles of Computing, Carnegie Mellon University
1
Divide and Conquer
? In computation:
? Divide the problem into "simpler" versions of itself.
? Conquer each problem using the same process (usually recursively).
? Combine the results of the "simpler" versions to form your final solution.
Examples:
Towers of Hanoi, Fractals,
Binary Search,
Merge Sort,
Quicksort,
and many, many more
4
Divide
Group of 8 Groups of 4 Groups of 2 Groups of 1
Now each "group" is (trivially) sorted!
3
Conquer (merge sorted lists)
4
Conquer (merge sorted lists)
5
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related searches
- high school computer science curriculum
- list of computer science topics
- benefits of computer science degree
- history of computer science pdf
- fundamentals of computer science pdf
- benefits of computer science career
- benefits of computer science education
- doctor of computer science salary
- examples of computer science math
- list of computer science journals
- examples of computer science projects
- list of computer science careers