class1.java

这是一个用java实现起泡排序的程序

import java.applet.Applet ;
import java.awt.*;
import java.util.*;
 public class Class1 extends Applet 
{public static int length=10,i=0,Length;
 initialvalue  chuli;
 static int[] array,array1;
 int cntj,cnt,j;
 TextField input1;
 Label prompt,DATA;
 manage input,output;
 initialvalue dealwith;
 
public void init()
{dealwith=new initialvalue();
 array= new int[10];
 array1= new int[10];
 input=new manage();
 output=new manage();
 input1=new TextField(10);
 prompt=new Label("请输入您要排序的数组长度(默认为10)：");
 Button refurbish=new Button("刷新");
 add(prompt);
 add(input1);
 add(refurbish); 
}

public void paint(Graphics g)
{Font oldFont;
 if(length>10)
 {array=new int[length];
  array1=new int[length];
 }
 dealwith.initialize();
 dealwith.easyexchange();
 oldFont=g.getFont();
 g.setFont(new Font("PLAIN",Font.PLAIN,20));
 g.drawString("数组没有排序前的存储情况如下：",40,80);
 g.setFont(oldFont);
 g.drawString(toString(),40,110);
 g.setFont(new Font("PLAIN",Font.PLAIN,20));
 g.drawString("数组经过选择排序处理后的存储情况如下：",40,140);
 g.setFont(oldFont);
 g.drawString(toString1(),40,170);
 g.setFont(new Font("PLAIN",Font.PLAIN,40));
 g.setColor(new Color(255,0,0));
 g.drawString(date(),40,220);
 g.setFont(oldFont);
}
public boolean action(Event e,Object o)
{
	if(e.target ==input1)
	{
		this.length=(int)Integer.parseInt(input1.getText());
		if(length<0)
			System.exit(0);
	}	 
	repaint();
	return true;
}
 public String toString()
 {String s;
  s=new String();
	 for(i=0;i<length;i++)
  {s=s+array1[i]+"       "+"\n";
  }
	return s; 
 }


 
public String toString1()
{String s;
 int i=1;
  s=new String();
  for(i=0;i<length;i++)
  {s=s+array[i]+"      ";
  }
  return (s); 
}
public String date()
{Date date = new Date();
 String strdat="";
 strdat = date.toLocaleString();
 strdat="现在时间是："+strdat;
 return strdat;
}
}


class initialvalue extends Class1
{
 
 public void initialize()
{
for(i=0;i<length;i++)
 {
  array[i]=(int)(Math.random()*100000);
  array1[i]=array[i];
 }
}

  public void easyexchange()
{
 for(i=0;i<length;i++)
 {cntj=i;
  cnt=array[i]; 
  for(j=i+1;j<length;j++)
  if(array[j]>cnt)
    {
     cnt=array[j];
     cntj=j;
     }
  if(cntj!=i)
  {
  cnt=array[i];
  array[i]=array[cntj];
  array[cntj]=cnt;
  }
 }
 }
}