bubble sort algorithm java

Java merge sort algorithm, bubble sort algorithm, selection sort algorithm, insert sort

two two sequential sequences in one-dimensional array into an ordered sequence. The merging algorithm can also be implemented by recursive algorithm, which is simpler in form, but has poor practicability. The number of merged algorithm merges is a very important amount, according to the calculation when there are 3 to 4 elements in the array, the number of merge

follows :1 voidBubble_1 (intR[],intN)2 { 3 intI= n-1;//initially, the last position remains the same4 while(i> 0) { 5 intpos= 0;//no record exchange at the beginning of each trip6 for(intj= 0; j) 7 if(R[j]> r[j+1]) { 8Pos= J;//record the location of the interchange9 intTMP = R[j]; r[j]=r[j+1];r[j+1]=tmp; Ten } Onei= POS;//prepare for the next sequencing A } -}2. The traditional

Java Learning (7), array, search algorithm, binary search method, bubble sort, select sort, insert sort, java bubble I. Common array search

**/ Public classBobsort {Private int[] array; Private intlength; /*** Constructor Function *@paramArray*/ PublicBobsort (int[] Array) { This. Array =Array; This. length =Array.Length; } /*** Print data in an array*/ Public voiddisplay () { for(intI:array) {System.out.print (i+" "); } System.out.println (); } /*** Bubble Sort*/ Public voidBobsort () { for(inti=0;i//

Bubble Sort: is the two elements that are contiguous by index, and if greater than/less than (depending on whether ascending or descending order is required), replace, otherwise do not make changes this round down, compares the n-1 times, n equals the number of elements; n-2 , n-3 ... One to the last round, compared 1 times so the comparison is decremented: from n-1 to 1 The total number of comparisons

packageorg.webdriver.autotest.study;importjava.util.*;p ublicclasssort_examp{ Publicstaticvoidmain (String[]args) {integer[]num={ 49,38,65,97,76,13,27,49,78,34,12,64,1};//insertsort (num); //selectsort (num); maopaosort (num); }//Direct Insert Sort publicstaticvoid Insertsort (Integer[]num) {system.out.println ("before sorting:"); for (inti=0;i Insert Sort, select sort