----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\Assignment11_Original_Sort\Siltz\testSorts
    
    Bubble Sort
    ===========
      143   59  249    7  110   81  185   99   56  139   13   49  138  233   11
        7   11   13   49   56   59   81   99  110  138  139  143  185  233  249
    Insertion Sort
    ==============
      143   59  249    7  110   81  185   99   56  139   13   49  138  233   11
        7   11   13   49   56   59   81   99  110  138  139  143  185  233  249
    Selection Sort
    ==============
      143   59  249    7  110   81  185   99   56  139   13   49  138  233   11
        7   11   13   49   56   59   81   99  110  138  139  143  185  233  249
    Quick Sort
    ==========
      193   42    7   59  234   23  114  113   45   27   24  198   54  230  189
        7   24   23   27   42   45   54   59  113  114  189  193  198  230  234
    
    This program has ended normally.
    
     ----jGRASP: operation complete.
    
Siltz
messed around with quicksort until he got it
insertion algorithm has a swap which is not desired
just move stuff out of the way of the value to be inserted