Algorithms - Sorting and Searching

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;

start Sub = middle Sub - 1;

start Sub = middle Sub + 1;

stop Sub = middle Sub - 1;

stop Sub = middle Sub + 1.

A binary search begins with the middle element in the array

A binary search continues having the array either until a match is found or until there are no more elements to search

If the search argument is greater than the value located in the middle of the binary, the binary search continues in the upper half of the array

For a binary search to work, the data in the array must be arranged in either alphabetical or numerical order