package huguang14;public class TestThread {/** * @param args */public static void main(String[] args) {// TODO Auto-generated method stub/*Thread2 t=new Thread2() ;Thread1 t1 = new Thread1();t1.start();t.t2.start();*/Thread1 t1 = new Thread1();Thread2 t2=new Thread2() ;Thread t = new Thread(t2);t1.start();t.start();}}
package huguang14;public class Thread1 extends Thread {public void run(){ System.out.println("冒泡排序"); RandomNumber randomNumber = new RandomNumber();randomNumber.RandomNumber1();int[]a=randomNumber.getArr();for(int j=0;j<a.length;j++){for(int i=0;i<a.length-j-1;i++){if(a[i]>a[i+1]){int t=a[i];a[i]=a[i+1];a[i+1]=t;}}} for (int i = 0; i < a.length; i++) { System.out.println("冒泡排序"+a[i]); } }}
package huguang14;public class Thread2 implements Runnable{Thread t2;public Thread2(){t2=new Thread(this);}@Overridepublic void run() { System.out.println("快速排序"); // TODO Auto-generated method stubRandomNumber arr = new RandomNumber();arr.RandomNumber1();int []a = arr.getArr(); quickSort(a, 0, a.length - 1); for (int i = 0; i < a.length; i++) { System.out.println("快速排序"+a[i] + ","); } } static int Partition(int[] a, int left, int right) { int tmp; //进行一趟縼E倥判丒返回中心记录位置 int pivot = a[left];//把中心置于a[0] while (left < right) { while(left<right && a[right]>=pivot) right--; //将比中心记录小的移到低端 tmp = a[right]; a[right] = a[left]; a[left] = tmp; while(left<right && a[left]<=pivot) left++; tmp = a[right]; a[right] = a[left]; a[left] = tmp; //将比中心记录大的移到高端 } a[left] = pivot; //中心移到正确位置 return left; //返回中心位置 } public static void quickSort(int[] a, int left, int right) { if(left >= right - 1) return; int pivot = Partition(a,left,right); quickSort(a, left, pivot-1); quickSort(a, pivot+1, right); } }
