Bubble sort-java

Sort-bubble sort

Basic idea: start at one end, compare the adjacent two elements, and find that the reverse is exchange. Here, you'll compare adjacent elements one by one, from backward forward (top to bottom).

Average Time: O (N2)

Best case: O (N)

Worst case scenario: O (n2) (reverse)

Auxiliary Space: O (1)

Stability: Stable

applicable scenario:N Compare hours

Java implementations:

1      Public Static voidBubblesort (int[] list) {2 3          for(inti = 0; i < list.length; i++) {4              for(intj = 1; J < List.length-i; J + +) {5                 if(List[j] < list[j-1]) {6                     inttemp =List[j];7LIST[J] = list[j-1];8LIST[J-1] =temp;9                 }Ten             } One         } A}

Bubble sort-java