Straight insertion sort

Binary insertion sort

Shell sort

Heap sort

Accessing and processing each record exactly once

Finding the location of the record with a given key

Arranging the data (record) in some given order

Adding a new record to the data structure

insertion sort

heap sort

quick sort

bubble sort

insertion sort

selection sort

heap sort

quick sort

middle Sub = (start Sub + stop Sub)/2;

middle Sub = start Sub + stop Sub/2;

middle Sub = middle Sub/2;

middle Sub = (stop Sub - start Sub)/2;