Please enable JavaScript.
Coggle requires JavaScript to display documents.
Brute force and exhaustive search, Decrease-and-Conquer, Divide-and…
-
Decrease-and-Conquer
Exploiting the relationship between a solution to a given instance of a problem and a solution to its smaller instance.
-
-
-
Insertion Sort
-
scans the sorted subarray from right to left until the first element smaller than or equal to A[n -1] is encountered to insert A[n - 1] right after that element
-
Divide-and-Conquer
-
Mergesort
-
divides a given array into two halves, sorting each of them recursively, and then merging the two smaller sorted arrays into a single sorted one
pros: Stability. The principal Shortcoming of mergesort is the linear amount of extra storage the algorithm requires