河內塔

01/02/06 recursion

import javax.swing.JOptionPane;
public class recursion {
public static void main(String[] arg){
String PString=JOptionPane.showInputDialog("請輸入一非負整數:");
int i=Integer.parseInt(PString);
System.out.println(i+"! = "+recursion.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;}
}

圖檔

01/02/06 modular sorting

import java.io.*;
public class lab0102{
public static void main(String args[])throws IOException{
double[] number= new double[3];
int x,y;
double z;
for(x=0;x<3;x++){
BufferedReader keyin= new BufferedReader(new InputStreamReader(System.in));
number[x]=Integer.parseInt(keyin.readLine());
}
System.out.println("after sorting:");
for(x=0;x<3;x++){
for(y=0;y<3;y++){
if (number[x]>number[y]){
z=number[x];
number[x]=number[y];
number[y]=z;
}
}
}
for(x=0;x<3;x++){
System.out.print(""+number[x]+" ");
}
System.out.println("");
System.exit(0);
}
}


圖檔

12/26 lab(2)

public class lab2{
public static void main(String[] args){
if(args.length==0)
System.out.println("no parameters");
else{
for(int j=args.length-1;0<=j;j--)
System.out.print(args[j]+" ");
}
}
}
圖檔