算法 第四版 2.1.18 可视轨迹

package Cap2_1;

import edu.princeton.cs.introcs.StdDraw;
import edu.princeton.cs.introcs.StdRandom;

public class Insertion extends sortTemplate{
	public static void sort(Comparable[] a){
		int N = a.length;
		for(int i=1;i0 && less(a[j], a[j-1]); j--)
				exch(a, j, j-1);
		}
	}
	public static void exch(Comparable[] a, int i, int j){
		drawSort(a, i, j);
		Comparable t = a[i];
		a[i] = a[j];
		a[j] = t;
		
//		drawSort(a, i, j);
		StdDraw.pause(100);
		StdDraw.clear();
	}
	public static void drawSort(Comparable[] a, int x1, int x2){
		StdDraw.setXscale(-1, a.length+1);
		
		Comparable max=a[0];
		for(int i=1;i