1. 使用for循环打印乘法口诀表
public class Example{
public static void main(String [] args){
for(int i=1;i<=9;i++){
for(int j=1;j<=i;j++){
int result=i*j;
System.out.print(i+"*"+j+"="+i*j+"\t");
}
System.out.println();
}
}
}
2. 递归实现20!
public class Example{
public static void main(String [] args){
System.out.println(Mul(20));
}
public static double Mul(double n){
if(n==1)
return 1;
else
return n*Mul(n-1);
}
}
3. 使用递归实现快速排序(Java实现)
public class Example{
public static int Partition(int []arr,int start,int end){
int key=arr[start];
while(start<end){
while(arr[end]>=key&&start<end){
end--;
arr[start] = arr[end];
}
while(arr[start]<=key&&start<end){
start++;
arr[end] = arr[start];
}
}
arr[start]=key;
return start;
}
public static void quickSort(int []arr,int start,int end){
if(start<end){
int index = Partition(arr, start, end);
quickSort(arr, start, index - 1);
quickSort(arr, index + 1, end);
}
}
public static void main(String [] args){
int []arr=new int[]{72,6,57,88,60,42,83,73,48,85};
int start=0;
int end=9;
quickSort(arr,0, 9);
for (int i = 0; i < 9; i++) {
System.out.println(arr[i]);
}
}
}
4. 使用数组静态初始化方式初始化一个大小为10的整型数组并输出。
public class Array{
public static void main(String [] args){
int []arr={0,1,2,3,4,5,6,7,8,9};
for(int i=0;i<=10;i++){
System.out.Println(arr[i]);
}
}
}