Code:
1 Public classTest {2 Public Static int[] Bublle_sort (inta[]) {3 for(inti = 0; i < a.length-1; i++) {4 BooleanExchange =false;5 for(intj = 0; J < A.length-i-1; J + +) {6 if(a[j+1]<A[j]) {7 intTMP =A[j];8A[J] = a[j+1];9a[j+1]=tmp;TenExchange =true; One } A - } - if(Exchange =false){ the Break; - } - } - returnA; + } - + Public Static voidMain (string[] args) { A //Bubble Sort atSystem.out.println ("************before bublle_sort**************"); - intA[] =New int[5]; - for(inti = 0; i < a.length; i++) { -A[i] = (int) (Math.random () *100); -SYSTEM.OUT.PRINTLN ("raw data:" +a[i]); - } inSystem.out.println ("************after bublle_sort**************"); - Bublle_sort (a); to for(inti = 0; i < a.length; i++) { + System.out.println (A[i]); - } the *}
Bubble sort time Complexity bit O (n^2), but ideally O (n), memory formula: outer tube turns inner tube row
Java Sort Bubble Sort