lab_Recursion

package welcome;
import java.io.*;
public class lab_Recursion
{
public static double recursive(double number)
{
if(number==0)
return 0;
else if(number==1)
{
return 1;
}
else return (number*recursive(number-1));
}

public static void main(String[] args) throws IOException
{
double n;
BufferedReader keyboard =new BufferedReader(new InputStreamReader(System.in));
System.out.println("please type positive number");
System.out.println("negative number is end.");
String input = keyboard.readLine();
double temp = Double.parseDouble(input.trim());
n=recursive(temp);
System.out.println(temp+"!="+n);
}
}

Lab 12-26-2005 (2)

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

0102 HW

import javax.swing.JOptionPane;
public class Recursive {
public static void main(String[] arg)
{ String PString=JOptionPane.showInputDialog("幾階層");
int i=Integer.parseInt(PString);
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 01-2

package worl;

public class LAB012 {
public static double[] sortt(double[] tmp)
{
int i,j;
double temp;
for (j = 0; j <> tmp[i - 1])
{
temp = tmp[i - 1];
tmp[i - 1] = tmp[i];
tmp[i] = temp;
}
}
}
return tmp;
}
public static void out(double[] temp2)
{

System.out.print("排序後陣列:");
for(int i=0 ; i < temp2.length ;i + +)
{
System.out.print(" " + temp2[i]);
}
}
public static void main(String[] args)
{
double[] num={45,558,78,6,8,0,35};
double[] num2;
num2=sortt(num);
out(num2);
}
}

Lab 12/26 (2)

ublic class shine8
{
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);
}
}

Homework 12/19

public class equal {
public static boolean equal(int a[],int b[])
{ if (a.length != b.length) {return false;}
else{ int i=0;
while (i < a.length) {
if (a[i] != b[i]) { return false; }
i++; }
}
return true;
}
public static void main(String[] args)
{ int[] a={1,9,6,4,0,2,1,2};
int[] b={1,9,6,4,0,2,1,2};
int k;
System.out.print("a={ ");
for(k=0; k
System.out.print(a[k]+" ");
System.out.println("}");
System.out.print("b={ ");
for(k=0; k
System.out.print(b[k]+" ");
System.out.println("}");
if(equal(a,b))
{System.out.println("a and b are equal.");}
else
{System.out.println("a and b are not equal.");}
}
}

12 / 19 lab

package untitled14;

import java.io.*;

public class add {
private static Object keyboard;
public static void main(String[] args) throws IOException,
NumberFormatException {
BufferedReader keyboard = new BufferedReader(new InputStreamReader(System.
in));

double tem;
double[] number = new double[5];
System.out.println("輸入5個數:");

for (int i = 0; i < 5; i++) {
number[i] = Double.parseDouble(keyboard.readLine());
}

for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
if (number[i] < number[j]) {
tem = number[i];
number[i] = number[j];
number[j] = tem;
}
}
}

System.out.println();
System.out.println("結果");

for (int i = 0; i < 5; i++){
System.out.println(number[i]);
}
}
}


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.println(""+number[x]);
}
System.exit(0);
}
}