test09.java

JAVA 排序算法实现

import java.applet.*;
import java.awt.*;
import java.lang.*;

public class test09 extends Applet {
    int arr[]=new int[80],
        ARR[]=new int[80],
        min=0,
        max=80,
        i=0,
        j=0,
        a1,
        a;
    boolean isSort=false;
    Button bt1 = new Button("开始排序");

    public test09() {
    add(bt1);
    do{
        arr[i]=min + (int)(Math.random()*(max-min+1));  //建立随机数
        i++;
      }while(i<80);

    do{
        ARR[j]=arr[j];
        j++;
      }while(j<80);
     repaint();
    }



    public void sort(int a[])
    {
       for (int i = a.length; --i>=0; ) {
	    boolean swapped = false;
	    for (int j = 0; j<i; j++) {

		if (a[j] > a[j+1]) {
		    int T = a[j];
		    a[j] = a[j+1];
		    a[j+1] = T;
		    swapped = true;
		}
        }

	    if (!swapped)
	    return;

	}
	    for(int p=0;p<=80;p++)
        {
           ARR[p]=a[p];
        }
        repaint();
    }


    public void paint(Graphics g)
    {
      sort(ARR);
    if(isSort==false){
     g.drawString("随机生成80个1~80的随机数：",20,40);
     for (a=0;a<=80;a++)
     {
         if(a<40)
         g.drawString(Integer.toString(arr[a]),20+a*20,60);
         else
         g.drawString(Integer.toString(arr[a]),20+(a-40)*20,70);
     }
     }
     else{
     for (a1=0;a1<=80;a1++)
     {
         g.drawString("最小值：",20,90);
         g.drawString(Integer.toString(ARR[0]),80,90);
         g.drawString("最大值：",150,90);
         g.drawString(Integer.toString(ARR[79]),200,90);
         if(a1<40)
         g.drawString(Integer.toString(ARR[a1]),20+a1*20,110);
         else
         g.drawString(Integer.toString(ARR[a1]),20+(a1-40)*20,120);
     }
     }
    }


    public boolean action(Event evt ,Object obj){
       if(obj.equals("开始排序"))
          {
            sort(ARR);

          }
          isSort=true;
          repaint();
            return true;
    }
}