07-2 버블 정렬

※ 버블 정렬(Bubble Sort) 

 - 인접한 두개의 원소를 비교하여 자리를 교환하는 방식

※ 구현

Main

public class Main {

       

       public static void main(String[] args) {

              

              int a[] = {69,10,30,2,16,8,31,22};

              BubbleSort bs = new BubbleSort();

              System.out.println("\n정렬할 원소 : ");

              for(int i =0; i<a.length; i++){

                     System.out.printf(" %d ", a[i]);

              }

              System.out.println();

              bs.Sorting(a);

       }

}

BubleSort

public class BubbleSort {

       

       int a[];

       

       public void Sorting(int a[]){

              this.a= a;

              

              for(int i = a.length ; i>=0; i--){

                     for(int j=0; j<a.length-1;j++){

                           if(a[j]> a[j+1]){

                                  swap(j,j+1);

                           }

                     }

              }

              printSortResult();

       }

       

       private void swap(int idx1, int idx2){

              int temp = a[idx1];

              a[idx1] = a[idx2];

              a[idx2] = temp;

       }

       

       private void printSortResult(){

              for(int i =0; i<a.length; i++){

                     System.out.printf(" %d ", a[i]);

              }

       }

}