class InsertionSort extends SortAlgorithm {
    void sort(int a[]) {
    	int i, j; int v;
		for (i = 1; i < a.length; i++) {
			v = a[i]; j = i;
			while (j > 0 && a[j-1] > v)
				{ a[j] = a[j-1]; j--; }
			a[j] = v;
			pause();
		}
	}
}