Bubble Sort

public void bubbleSort(int[] numbers){

 boolean numbersSwitched;

do{

  numbersSwitched = false;

for(int i =0; i< numbers.length-1;i++){

  if(numbers[i+1]<numbers[i]){

   int tmp =numbers[i+1];

   numbers[i+1] = numbers[i];

numbers[i] =tmp;

numbersSwitched= true;

}

}

}while(numbersSwitched);

}

비효율적

o(n제곱)

정렬시에는 o(n)