Sorting and Searching

selection sort

continuously finds min value and moves it to the front

arr[0] swaps with min

arr[1] swaps with next min

insertion sort

setting a[0] as the smallest, creating a sorted and unsorted half, taking elements from the unsorted half inserting it into the sorted half

merge sort

splits list in half, merge sorts both halves, and merges together

merge method

merge(a, 0, 3, 5): for array a,

• 3 is the number that differentiates sorted and unsorted

• 0 is the first element

• 5 is the last

binary search

divides half the sorted array in half, divide and conquer searching

sequential search

traversing through an array until key is found