| Sorting algorithms | Techniques for Sorting In-place vs extra memory Analyze by counting compares and exchanges(array accesses) Selection Insertion Bubble Merge Quick 1. Selection Sorting Iterative and in-place sorting algorithm that divides the data structure in two sublists: the ordered one, and the unordered one First, find the smallest item in the array, and exchange it with the first entry. Then, find the next smallest item and exchange...
read more