Lab 1-02-2006 Recursion

package xxx;

import java.io.*;

public class Recursive
{
public static void main(String[] arg)
{
String MyString=JOptionPane.showInputDialog("幾階?");
int i=Integer.parseInt(MyString);
System.out.println(i+" 階 = "+Recursive.orders(i));
System.exit(0);
}
public static int orders(int i)
{
int n=1;
if (i==0)
{
return 1;
}
else if(i>0)
{
return(orders(i-1)*i);
}
else return 0;
}
}

Lab 1-02-2006 modular sorting

package xxx;

import java.io.*;

public class SortingDemo
{
public static void main(String args[])throws IOException
{
double[] number= new double[5];
int x,y;
double z;
for(x=0;x<5;x++)
{
BufferedReader keyin= new BufferedReader(new InputStreamReader(System.in));
number[x]=Integer.parseInt(keyin.readLine());
}
System.out.println("-------------------------------");
System.out.println("由大到小排列");
for(x=0;x<5;x++)
{
for(y=0;y<5;y++)
{
if (number[x]>number[y])
{
z=number[x];
number[x]=number[y];
number[y]=z;
}
}
}
for(x=0;x<5;x++)
{
System.out.print(""+number[x]+" ");
}
System.out.println("");
System.exit(0);
}
}
---------------------------------------------------------------------------------------------------

Lab 12-26-2005 (2)

public class myProgram
{
public static void main(String[] arg)
{
int i;
if(arg.length==0)
{
System.out.println("EORR");
System.exit(0);
}
for(i=arg.length-1;i>=0;i--)
{
System.out.println(arg[i]);
}
System.out.println("The length of parameter is "+arg.length);
}
}
---------------------------------------------------------------------------------------------------