/*
 * @(#)DesertionSortAlgorithm.java	1.0 08/04/24 Ivan Fomichev
 *
 * Copyright (c) 2008 Ivan Fomichev
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

/**
 * A desertion sort demonstration algorithm
 * DesertionSortAlgorithm.java, Thu Oct 27 10:32:35 1994
 *
 * @author      ifomichev@gmail.com
 * @version 	1.0, 24 Apr 2008
 */
class DesertionSortAlgorithm extends SortAlgorithm {
    void sort(int a[]) throws Exception {
        sort(a, 0, a.length, 0);
        pause(-1);
    }
    
    void sort(int a[], int start, int end, int pos) throws Exception {
        if (pos == end) return;
        pause(pos);
        desert(a, start, end, pos);
        sort(a, start, end, pos + 1);
    }
    
    void desert(int a[], int start, int end, int pos) throws Exception {
        if (pos == start) return;
        int to = (a[pos] < a[start]) ? start : start + 1;
        
        int t = a[pos];
        for (int i = pos; i > to; i--) a[i] = a[i - 1];
        a[to] = t;

        if (to > start) sort(a, start + 1, pos + 1, start + 1);
    }
}