/*
 * @(#)SelectionSortAlgorithm.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.
 */

/** A selection 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 SelectionSortAlgorithm extends SortApplet.SortAlgorithm {
   
   @Override void sort(int[] a) {
      for (int i = 0; i < a.length; ++i) {
         int min = i;
         int j;
         
         //  Find the smallest element in the unsorted list
         for (j = i + 1; j < a.length; ++j) {
            if (stopRequested) return;
            if (a[j] < a[min]) {
               min = j;
            }
            pause(i, j);
         }
         
         /* Swap the smallest unsorted element into the end of the
          *  sorted list.
          */
         int temp = a[min];
         a[min] = a[i];
         a[i] = temp;
         pause(i, j);
      }
   } // sort(int[])
   
} // class SelectionSortAlgorithm