----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\Assignment11_Original_Sort\Murat\testSorts
    
    --- BUBLE SORT ---
    The buble sort is a type of sorting in
    which the biggest elements in the list
    'buble' to the end of the list.
    
    the UNSORTED array:
       47  115  137   61  190   17   71  193  144   87  128  181  189  208   73
    the SORTED array:
       17   47   61   71   73   87  115  128  137  144  181  189  190  193  208
    
    --- SELECTION SORT ---
    The selection sort is a type of sorting
    in which each element of a list goes
    to its place among the previously sorted
    elements/part of the list.
    
    the UNSORTED array:
      124  221   44  205  130   41  131  217   88  211  163  248  104   23  249
    the SORTED array:
       23   41   44   88  104  124  130  131  163  205  211  217  221  248  249
    
    --- INSERTION SORT ---
    The insertion sort is a type of sorting
    in which the first element of a list is
    swapped with the smallest element of the
    list, then the second element is swapped
    with the next smallest element of the
    list, and so on until the list is sorted.
    
    the UNSORTED array:
      245  233  162   33  247  226   11   57   54  103   56   81  242  230  112
    the SORTED array:
       11   33   54   56   57   81  103  112  162  226  230  233  242  245  247
    
    --- QUICKSORT ---
    The quicksort is not working.
    
    the UNSORTED array:
      181  168  145  144  239   69  132  141  125   88  124  114   35  225  202
    the SORTED array:
      181  168  145  144  239   69  132  141  125   88  124  114   35  225  202
    
    --- THE TEST PROGRAM HAS ENDED SUCCESSFULLY ---
    
     ----jGRASP: operation complete.
    
Murat,
The algorithm you describe as Insertion sort is really selection sort.

There are no SWAPS in Insertion sort