package com.bdqn.yingyun; |
public class MaoPao { |
public static void main(String[] args) { |
int [] arr = { 12 , 3 , 56 , 7 , 33 , 54 }; |
for ( int i = 0 ; i < arr.length - 1 ; i++) { |
for ( int j = 0 ; j < arr.length - 1 - i; j++) { |
if (arr[j] > arr[j + 1 ]) { |
int temp = arr[j]; |
arr[j] = arr[j + 1 ]; |
arr[j + 1 ] = temp; |
} |
} |
} |
for ( int x = 0 ; x < arr.length; x++) { |
System.out.print(arr[x] + " " ); |
} |
} |
} |