⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 java_6.java

📁 里面有我的JAVA实验和一些教程
💻 JAVA
字号:
import java.io.*;

public class Sort_Compare
{

	public static void main(String args[])
	{
		//Sort_Compare sc = new Sort_Compare();

		double arr[] = new double[2000]; 
		for(int i = 0; i<2000; i++)
		{
			arr[i] = Math.random();
		}
		System.out.print("排序前数组的前十个元素\n");
		for(int j = 0; j<10; j++)
		{
			System.out.print("arr["+j+"]="+arr[j]+"  ");
		}
		System.out.print("\n排序前数组的后十个元素\n");
		for(int j = 1999; j>=1990; j--)
		{
			System.out.print("arr["+j+"]="+arr[j]+"  ");
		}
		System.out.print("\n\n");
		insertSort in = new insertSort(arr);

		System.out.print("\n\n");		
		bubbleSort bu = new bubbleSort(arr);
		bu.start();
		in.start();
		
	}
}

class insertSort extends Thread
{
	int i,j,len;
	double arri[] = new double[2000]; 
	double temp;
	long start,end,time;

	insertSort(double arr1[])
	{
		arri = arr1;
	}
	public void run()
	{
		len = arri.length;
		System.out.print("直接插入算法:\n");
	/*	for(j = 0; j<10; j++)
		{
			System.out.print("arr["+j+"]="+arri[j]+"  ");
		}
		*/
		start = System.currentTimeMillis();
		for(i=1;i<len-1;i++)
		{
			temp=arri[i];
			j=i-1;
			while((j>=0)&& (temp<arri[j]))
			{
				arri[j+1]=arri[j];
				j--;
			}
		    if(j!=(i-1)) arri[j+1]=temp;
		}
		end = System.currentTimeMillis();
		System.out.print("\n排序后的前十个元素:\n");
		for(j = 0; j<10; j++)
		{
			System.out.print("arr["+j+"]="+arri[j]+"  ");
		}
		System.out.print("\n排序后的后十个元素:\n");
		for(j = 1999; j<=1990; j--)
		{
			System.out.print("arr["+j+"]="+arri[j]+"  ");
		}
		time = end-start;
		System.out.print("\n直接插入算法时间为"+time);
		
	}
}

class bubbleSort extends Thread
{
	int i,k,len;
	double arrb[] = new double[2000]; 
	double temp;
	long start,end,time;

	bubbleSort(double arr2[])
	{
		arrb = arr2;
	}
	public void run()
	{
		len = arrb.length;
		try
		{
			sleep(200);
		
		System.out.print("\n\n冒泡算法:\n");
		for(k = 0; k<10; k++)
		{
			System.out.print("arr["+k+"]="+arrb[k]+"  ");
		}
		start = System.currentTimeMillis();
		for(i=0;i<len-1;i++)
			for(k=len-1;k>i;k--)
			 if(arrb[k]<arrb[k-1])
			 { 
				 temp=arrb[k-1];
				 arrb[k-1]=arrb[k];
				 arrb[k]=temp;
			 }
		end = System.currentTimeMillis();
		System.out.print("\n");
		for(k = 0; k<10; k++)
		{
			System.out.print("arr["+k+"]="+arrb[k]);
		}
		
		time = end-start;
		System.out.print("\n冒泡算法时间为"+time);

		}
		catch(InterruptedException e)
		{
		}
		
       
       }
		
		
	
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -