Friday, June 16, 2006

"Lab Static Method"

package s9226307;
public class s9226307
{
private static int prenum = 1;
private static int num = 1;
private static int sum = 1;
public static int next()
{
sum = sum + prenum;
prenum = num;
num = sum;
return sum;
}
}

Lab Sorting

package s9226307;


public class Sorting
{
public static void main(String args[])
{
double[] number= {4, 3, 6, 7, 5,4.3,8,9.9,11,2};
int x,y;
double z;

for(x=0;x<10;x++) y="0;y<10;y++)">number[y])
{
z=number[x];
number[x]=number[y];
number[y]=z;
}
}
}

for(x=0;x<10;x++)
{
System.out.print(" "+number[x]+" ");

}
System.out.println("");
System.out.println("由大到小");
System.exit(0);
}
}

"Lab Recursive Method"

package s9226307;

public class s9226307 {
public static void main(String[] args) {
System.out.println(""+recursive(3,1,2,3));
}
public static int recursive(int n,int src,int aux,int des)
{
if(n==1)
{
System.out.println("Move " +1+ " from " +src+ " to "+des);

}
else
{
recursive(n-1, src, des, aux);
System.out.println("Move " +n+ " from " +src+ " to "+des);
recursive(n - 1, aux, src, des);
}
return 0;

}
}

"Lab Hanoi Tower"

package s9226307;

public class s9226307 {
public static void main(String[] args) {
System.out.println(""+recursive(3,1,2,3));
}
public static int recursive(int n,int src,int aux,int des)
{
if(n==1)
{
System.out.println("Move " +1+ " from " +src+ " to "+des);

}
else
{
recursive(n-1, src, des, aux);
System.out.println("Move " +n+ " from " +src+ " to "+des);
recursive(n - 1, aux, src, des);
}
return 0;

}
}

Monday, June 12, 2006

"Lab Recursive Method"

package s9226307;


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

"Lab Sorting"

public class ArrayOfLength
{
public static void main (String[] arges)
{
int [] lenght= {12,54,66,88,99};
for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
if(lenght[i]>lenght[j])
{
int a;
a=lenght[i];
lenght[i]=lenght[j];
lenght[j]=a;
}
}
}
for(int i=0;i<5;i++)
{
System.out.println(lenght[i]);
}
}

}

Homework 5/29

package s9226307;
public class Square
{
public static void main(String[] args)
{
int i , j ;
int box;
int[]age={9,7,10,1,3};
for(i=0;i<5;i++) j="i+1;j<5;j++)">age[i])
{
box=age[i];
age[i]=age[j];
age[j]= box ;
}
}
System.out.println(age[i]*age[i]);
}
}
}

====================
100

81

49

9

1