星期三, 1月 04, 2006

Lab 1-02-2006 Recursion

import javax.swing.JOptionPane;
public class Recursion
{
public static void main(String[] arg)
{
String PString=JOptionPane.showInputDialog("Please enter a number n=");
int i=Integer.parseInt(PString);
System.out.println( +i+"! is "+Recursion.com(i));
System.exit(0);
}
public static int com(int i)
{
int n=1;
if (i==0)
{
return 1;
}
else if(i>0)
{
return(com(i-1)*i);
}
else return 0;
}
}

Lab 1-02-2006 modular sorting

package qq1;
public class labmodular_sorting
{
public static void main(String[] args)
{
double[] num1={7,2,-1,3,8,9,10,-3};
double[] num2;
num2=input(num1);
output(num2);
}
public static double[] input(double[] num1)
{
int a,b;
double k;
for(a=0;a < b="a+1;b" a="">num1[b])
{k=num1[a];
num1[a]=num1[b];
num1[b]=k;
}}}
return num1;
}
public static void output(double[] k)
{
System.out.print("Result:");
for(int i=0 ; i < k.length ;i++)
{
System.out.print(" "+k[i]);
}}}

結果:

-3,-1,2,3,7,8,9,10

星期一, 1月 02, 2006

LAB12-26 2005(2)

public class program{
public static void main(String [] args){
int i;if(args.length == 0){
System.out.println("No input numbers.");
}else
{
System.out.println("Output:");
for(i=(args.length-1) ; i >= 0 ; i--){
System.out.print(args[i]+" ");}}}}