假设有整型数组{2,13,45,1,98,12,44}，请用实现一个算法将这个数组进行排序，排序的结果为非递减，排序算法可以采用冒泡排序算法、快速排序算法、插入排序算法或选择排序算法中的任意一个目

Java程序设计

程序设计题目

如题

冒泡

public static void main(String[] args) {
int array[] = { 2, 13, 45, 1, 98, 12, 44 };
int i = 0, j = 0, temp = 0;
for (i = 0; i < array.length; i++) {
for (j = 0; j < array.length - i; j++) {
if (array[j] < array[j + 1]) {
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
for (i = 0; i < array.length; i++) {
System.out.println(array[i]);
}

void main() { int a[]={2,13,45,1,98,12,44}; int tmp; int count=sizeof(a)/4; for(int i=0;i<count;i++) { for(int j=i+1;j<count;j++) { if(a[i]>a[j]) { tmp=a[i]; a[i]=a[j]; a[j]=tmp; } } } for(int k=0;k<count;k++) { printf("%d\n",a[k]); } scanf("%d",&tmp); }

public class Sort { public static void main(String[] str){

int[] num = new int[3]; int[] count = {2,13,45,1,98,12,44}; int temp=0; for(int i=0;i<count.length; i++){ for(int j=0; j<count.length-1-i; j++){ if(count[j]>count[j+1]){ temp=count[j]; count[j] = count[j+1]; count[j+1] = temp; } } } for(int i=0; i<count.length; i++){ System.out.println(count[i]); } } }

插入排序： public class test { public static void main(String args[]) throws Exception { int[] a = {2,13,45,1,98,12,44}; sort(a); for(int i : a) System.out.print(i + " "); } static void sort(int[] a) { for(int i = 1; i < a.length; ++i) { int k = a[i]; int j = i - 1; while(j >= 0 && a[j] > k) { a[j+1] = a[j]; --j; } a[j+1] = k; } } }