package com.saic.grape.controller;
public class NumberTest3 {
/** * 实现冒泡程序2 */
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] numb = new int[] { 3, 42, 57, 1, 32, 24 };
int leng = numb.length;
System.out.println("数组长度:"+leng);
System.out.println("排序前的数组各个值:");
for (int i = 0; i < leng; i++)
{
System.out.print(numb[i] + "\t");
}
System.out.println("\n");
swap(numb);
System.out.println("数组排序后:");
for (int i = 0; i < leng; i++) {
System.out.print(numb[i] + "\t");
}
System.out.println();
cfb();
}
//冒泡排序逻辑
private static void swap(int[] numb) {
int len = numb.length;
int i, j;
int temp;
for (i = 1; i <= len; i++) {
for (j = len - 1; j >= 1; j--) {
if (numb[j] > numb[j - 1]) {
temp = numb[j];
numb[j] = numb[j - 1];
numb[j - 1] = temp;
}
}
}
}
//乘法表逻辑代码
public static void cfb() {
for (int i=1;i<=9;i++) {
for (int j=1;j<=i;j++){
System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.print("\n");
}
}
}
public class NumberTest3 {
/** * 实现冒泡程序2 */
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] numb = new int[] { 3, 42, 57, 1, 32, 24 };
int leng = numb.length;
System.out.println("数组长度:"+leng);
System.out.println("排序前的数组各个值:");
for (int i = 0; i < leng; i++)
{
System.out.print(numb[i] + "\t");
}
System.out.println("\n");
swap(numb);
System.out.println("数组排序后:");
for (int i = 0; i < leng; i++) {
System.out.print(numb[i] + "\t");
}
System.out.println();
cfb();
}
//冒泡排序逻辑
private static void swap(int[] numb) {
int len = numb.length;
int i, j;
int temp;
for (i = 1; i <= len; i++) {
for (j = len - 1; j >= 1; j--) {
if (numb[j] > numb[j - 1]) {
temp = numb[j];
numb[j] = numb[j - 1];
numb[j - 1] = temp;
}
}
}
}
//乘法表逻辑代码
public static void cfb() {
for (int i=1;i<=9;i++) {
for (int j=1;j<=i;j++){
System.out.print(i+"*"+j+"="+(i*j)+"\t");
}
System.out.print("\n");
}
}
}