package com.tiger.Algorithm;
public class BubbleSort {
public static void main(String[] args) {
int[] sortNum={1,5,3,64,6,42,23,43,2,5,2,4,5,6,2,4,4,2,12,63,21,35};
int temp=0;
for (int i = 0; i < sortNum.length-1; i++) {
for (int j = 0; j < sortNum.length-1-i; j++) {
if(sortNum[j]>sortNum[j+1]){
temp =sortNum[j];
sortNum[j]=sortNum[j+1];
sortNum[j+1]=temp;}
}
}
for (int i = 0; i < sortNum.length; i++) {
System.out.println(sortNum[i]);
}
}
}
public class BubbleSort {
public static void main(String[] args) {
int[] sortNum={1,5,3,64,6,42,23,43,2,5,2,4,5,6,2,4,4,2,12,63,21,35};
int temp=0;
for (int i = 0; i < sortNum.length-1; i++) {
for (int j = 0; j < sortNum.length-1-i; j++) {
if(sortNum[j]>sortNum[j+1]){
temp =sortNum[j];
sortNum[j]=sortNum[j+1];
sortNum[j+1]=temp;}
}
}
for (int i = 0; i < sortNum.length; i++) {
System.out.println(sortNum[i]);
}
}
}