/*
 * @(#)InsertSortAlgorithm.java   1.0 95/06/23 Jason Harrison
 *
 * Copyright (c) 1995 University of British Columbia
 *
 * Permission to use, copy, modify, and distribute this software
 * and its documentation for NON-COMMERCIAL purposes and without
 * fee is hereby granted provided that this copyright notice
 * appears in all copies. Please refer to the file "copyright.html"
 * for further important copyright and licensing information.
 *
 * UBC MAKES NO REPRESENTATIONS OR WARRANTIES ABOUT THE SUITABILITY OF
 * THE SOFTWARE, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
 * TO THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
 * PARTICULAR PURPOSE, OR NON-INFRINGEMENT. UBC SHALL NOT BE LIABLE FOR
 * ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR
 * DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES.
 */

/** An insertion sort demonstration algorithm. <br />
 *  <br />
 *  Author Jason Harrison, his version 1.0, 23 Jun 1995<br />
 *  <br />
 *  Modif. 15.11.2005, Albrecht Weinert (a-weinert.de) :<br />
 *  {@link SortApplet.SortAlgorithm} + Kleinigkeiten.<br />  
 *  <br />
 *  @author   Albrecht Weinert
 *  @version  V.161, 28.05.2011
 */
public final class InsertionSortAlgorithm extends SortApplet.SortAlgorithm {

   @Override void sort(int[] a)  {
      for (int i = 1; i < a.length; ++i) {
         int j = i;
         int bubble = a[i];
         while ((j > 0) && (a[j - 1] > bubble)) {
            if (stopRequested) {
               return;
            }
            a[j] = a[j-1];
            j--;
            pause(i,j);
         }
         a[j] = bubble;
         pause(i, j);
      }
   } // sort()

} // class InsertionSortAlgorithm