Bubble sort (Java)

Algorithm Core

1  Public voidBubblesort () {2          for(inti=0;i<length;i++) {//a couple of times .3              for(intj=0;j<length-i-1;j++) {//in each trip, the last I was in an orderly state.4                 if(a[j]>a[j+1]){5Swap (j,j+1);6                 }7             }8         }9}

Complete algorithm

1  PackageBubblesort;2 3  Public classSort {4      Public Static voidMain (String args[]) {5Array arr =NewArray (10);6          for(inti=0;i<10;i++){7Arr.insert (10-i);8         }9 Arr.bubblesort ();Ten Arr.display (); One     } A      - } - classarray{ the     Private int[]a; -     Private intlength; -      PublicArray (intmax) { -A =New int[Max]; +Length=0; -     } +      Public voidInsertintvalue) { Aa[length]=value; atlength++; -     } -      Public voiddisplay () { -          for(inti=0;i<a.length;i++){ -System.out.println ("a[" +i+ "]=" +a[i]); -         } in     } -      Public voidBubblesort () { to          for(inti=0;i<length;i++) {//a couple of times . +              for(intj=0;j<length-i-1;j++) {//in each trip, the last I was in an orderly state. -                 if(a[j]>a[j+1]){ theSwap (j,j+1); *                 } $             }Panax Notoginseng         } -     } the      Public voidSwapintIndexa,intIndexb) { +         inttemp =A[indexa]; Aa[indexa]=A[indexb]; thea[indexb]=temp; +     } -}

Run results

Bubble sort (Java)