insertion sort java code

Java sorting algorithm (iv): bubbling sort　　Bubble sort is a sort of computer, and its time complexity is O (n^2), although it is less than heap sort, quick sort O (Nlogn, base 2). But there are two advantages1, programming comple

sorted sequences, which is used to hold the merged sequence, set two pointers, The initial position is the starting position of two sorted sequences, Compare the elements pointed to by two pointers, select a relatively small element into the merge space, And move the pointer to the next position; Repeat step 3 until a pointer reaches the end of the sequence; Copies all the remaining elements of another sequence directly to the end of the merge sequence. a

Brief introductionThe hill sort (narrowing increment method) belongs to the insertion class sort, which is proposed by the shell, and Hill sort makes a simple improvement on the direct Insertion Order: It moves the data items in a large span by increasing the spacing between

the middle axis, the right is larger than the middle axis, and then the division of the method, respectively, the two separate array to sort.Implementation code:/*** Quick Sort * *@paramnumbers *@paramStart *@paramEnd*/ Public Static voidQuickSort (int[] numbers,intStartintend) { if(Start end) { intbase = Numbers[start];//Selected Datum value (first value as Datum) intTemp//Record

Code from a code cloudpublic static void Shellsort (int[] arr) {//Initialize incrementInth = 1;//Calculate maximum interval, formula: H = h * 3 + 1While (H h = H * 3 + 1; }//Zoom out increments for sortingWhile (h > 0) { //Insert Sortint Waitinsert;//wait for the number of insertionsint i,j;//i Indicates the current number of subscripts to be inserted, and J indicates the ordinal position of the comparison

[Basic idea]The records that originally have a large number of records are grouped into several sub-sequences, at which time the number of records to be sorted in each subsequence is less, and then the sequence of direct insertion in these subsequence sequence, when the entire series is basically ordered, and then a direct insertion of the whole record to sort.The so-called basic order, is the small keyword

1. IntroductionThe sorting of this and the array is not the same.In fact, Java for the array and list of the order has been implemented, for the array , you can directly use arrays.sort, for list and vector , you You can use the Collections.sort method .The Java API provides 2 methods for sorting collection types:Java.util.Collections.sort (java.util.List) java.util.Collections.sort (java.util.List, Java.u

finished.Third, the realization of ideas:With the double loop, the outer loop variable is set to I and the inner loop variable is set to J. If there are n number needs to be ordered, then the outer loop repeats n-1 times, the inner loop repeats n-1,n-2,...,1 times sequentially. Each comparison of the two elements are related to the inner loop j, they can be identified by a[j] and a[j+1], the value of I sequentially,..., n-1, the value of each i,j is 0,1,2,... n-i.Set the array length to N:1. Co

starting position of the sort sequenceB, Then continue looking for the smallest (large) element from the remaining unsorted elements and place it at the end of the sorted sequence. C, repeat the second step until all the elements are sorted.2. Motion Diagram Demo650) this.width=650; "Src=" https://s5.51cto.com/wyfs02/M00/95/C5/wKioL1kZfYiR-GAjAAAs5uKwBWE463.png-wh_500x0-wm_ 3-wmp_4-s_825999891.png "title=" 13.png "alt=" Wkiol1kzfyir-gajaaas5ukwbwe463

Java record-67-in-depth analysis of Collections's sort methodThe Collections class can sort the stored and List elements by the sorting method for the elements, or by the specified sorting class. The Collections class provides two static sort Methods: sort (List public stat

Directory (?) [+] Introduction to selection sorting algorithm The selection sort is very similar to the bubble sort, and is a layer -by-layer process, with the difference being that the bubble sort will frequently swap positions, and the selection order is just the location of the largest element and the top swap, just once . So the time constants are smaller and

The Java Collection Tool class collections provides two sorts of methods, namely: Collections.sort (List List) Collections.sort (List list,comparator c) The first is called the natural sort, the object that participates in the order implements the comparable interface, overrides its CompareTo () method, implements the comparison size rule of the object in the method body, the example is as

, and place it at the beginning of the sort sequence Then continue looking for the smallest (large) element from the remaining unsorted elements and place it at the end of the sorted sequence. Repeat the second step until all the elements are sorted. 2. Dynamic Diagram Demonstration650) this.width=650; "Src=" https://s2.51cto.com/wyfs02/M01/95/36/wKiom1kSzqbgjq4sAAAs5uKwBWE096.png-wh_500x0-wm_ 3-wmp_4-s_68824875.png "title=" 12.