insertion sort

This is a simple test of an insertion sort subroutine with timing information.
The program will two arrays of random real numbers using insertion sort and time the results. The first array is random numbers. The second array is the first array with a random fraction of values replaced by new ones, in order to demonstrate that insertion sort is faster with nearly-sorted arrays.