bubblesort

baijiao8468

于 2014-03-14 15:41:00 发布

阅读量76

点赞数

原文链接：http://www.cnblogs.com/growAriel/p/3600719.html

版权

package datestructure;

class Bubblesort
{
private int[] a;
private int nElems;

public Bubblesort(int maxsize)
{
  a=new int[maxsize];
  nElems=0;
}

public void insert(int value)
{
  a[nElems]=value;

nElems++;

}

public void bubblesort()
{
  int i,j;
  for(i=0;i<nElems-1;i++)
  {
   for(j=0;j<nElems-1-i;j++)
   {
    if(a[j]>a[j+1])
     //swap(j,j+1);
    {
     int k=0;
     k=a[j];
     a[j]=a[j+1];
     a[j+1]=k;
    }
   }
  }
}
/*public void swap(int i,int j)
{
  int k=0;
  k=a[i];
  a[i]=a[j];
  a[j]=k;
}*/

public void display()
{
  int j;
  for(j=0;j<nElems;j++)

   System.out.print(a[j]+" ");
   System.out.println("");
}

}

///

package datestructure;

public class BubbleApp
{
   public static void main(String[] args)
   {
    int maxsize=100;
    Bubblesort Bubarray;
    Bubarray=new Bubblesort(maxsize);

    Bubarray.insert(22);
    Bubarray.insert(33);
    Bubarray.insert(55);
    Bubarray.insert(88);
    Bubarray.insert(44);
    Bubarray.insert(66);
    Bubarray.insert(11);
    Bubarray.insert(77);
    Bubarray.insert(99);
    Bubarray.insert(25);

    Bubarray.display();

    Bubarray.bubblesort();

    Bubarray.display();


   }

}