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

📄 question1.java

📁 java课程的资料以及实验的代码
💻 JAVA
字号:
class Question1
{
	static void ascendingSort(int[] number)
	{
		int l=number.length;
		int i,j,k;
		for (i=0;i<l-1;i++)
		for (j=i+1;j<l;j++)
		if (number[i]>number[j])
		{
			k=number[i];
			number[i]=number[j];
			number[j]=k;
		}
	}
	
	static void descendingSort(int[] number)
	{
		int l=number.length;
		int i,j,k;
		for (i=0;i<l-1;i++)
		for (j=i+1;j<l;j++)
		if (number[i]<number[j])
		{
			k=number[i];
			number[i]=number[j];
			number[j]=k;
		}
	}

	static void reset(int[] number, int[] reserved)
	{
		int i;
		for (i=0;i<reserved.length;i++) number[i]=reserved[i];
	}
	
	public static void main(String args[])
	{
		//instruction follows numbers, a is "ascending" order, d is "descending" order
		//the first n-1 strings contain numbers, the last one is sorting instruction
		//20,30,50,10,d is valid input
		try
		{
			String[] num=args[0].split(",");
			int length=num.length;
			int [] number=new int[length-1];
			int i;
			for (i=0;i<length-1;i++) number[i]=Integer.parseInt(num[i]);
			char order=num[length-1].charAt(0);
			
			int[] reserved=new int[length-1];
			for (i=0;i<length-1;i++) reserved[i]=number[i];
			if ((order=='a')||(order=='A'))
			{
				ascendingSort(number);
				System.out.println("sorting is ascending,result is \n");
			}
			else 
			if ((order=='d')||(order=='D')) 
			{
				descendingSort(number);
				System.out.println("sorting is descending,result is \n");
			}
			else throw new Exception();
			for (i=0;i<length-1;i++) System.out.println(number[i]+" ");
			System.out.println("\nnow the array is reset\n");
			reset(number,reserved);
			for (i=0;i<length-1;i++) System.out.print(number[i]+" ");
		}
		catch (Exception e)
		{
			System.out.println("input error\n");
		};
	}
}

⌨️ 快捷键说明

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