Please enable JavaScript.
Coggle requires JavaScript to display documents.
Selection Sort and Bubble Sort, Decrease and Conquer, Divide and Conquer -…
-
Decrease and Conquer
Insertion Sort
-
If you have n elements in which n-1 elements are sorted, to sort the n elements you just have to find the position for the nth element in the already sorted list.
-
-
-
Technique based on exploiting the relationship between a solution to a given instance of a problem and a solution to its smaller instance.
-
-
Divide and Conquer
Merge Sort
-
Divide the list into two parts, sort each one then merge them into a single sorted array
Use two pointers, each pointing to elements in each sorted array. Compare the elements of each pointer and put the smaller in a new array. Make the pointer to the smaller element point to the next element of the array and repeat the process.
-
-
