Lab 1-02-2006 Recursion

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

public static void main(String[] args) throws IOException{
double num;
BufferedReader keyboard =
new BufferedReader(new InputStreamReader(System.in));
System.out.println("Please enter a positive number.");
String nextString = keyboard.readLine();
double next = Double.parseDouble(nextString.trim());
num=recursive(next);
System.out.println(next+"!="+num);
}
}

Lab 1-02-2006 modular sorting

package work;
public class modularsorting
{
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)
{
for(int i=0 ; 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-2005 (2)

package welcome;

public class someProgram
{
public static void main(String[] arg)
{
int i;
if( arg.length == 0 )
{
System.out.println("ERROR");
System.exit(0);
}

for( i=arg.length;i>0;i--)
{
System.out.println( arg[i] );}

System.out.println("The length of parameter is " + arg.length);
}
}