binsert.java

来自「用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等」· Java 代码 · 共 44 行

package main.algorithm;

import java.awt.*;
import javax.swing.*;
import main.Gracie;

public class BInsert extends Gracie{
	
	public BInsert(){
		setBackground(Color.white);
		new Thread(this).start();
	}
	
	public String getName(){
		return "折半插入";
	}
	
	public String getCommand(){
		return "BInsert";
	}
	
	public void sort(){
		//	try{
		for(int i=1;i<array.length && start;i++){
			int low=0, high=i-1;
			//			draw(-1,i,-1);
			while(low<=high && start){
				int m=(low+high)/2;
				if(array[i]<array[m]) high=m-1;
				else low=m+1;
			}
			for(int j=i-1;j>=0 && j>=high+1 && start;j--){
				exchange(j,j+1);
				//			Thread.sleep(sleep);
				//			repaint();
				//			Thread.sleep(sleep);
			}
		}
		//}
		//catch(InterruptedException e){e.printStackTrace();}
	}
}