Initial data commit
This commit is contained in:
parent
72d218235f
commit
f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
|
|
@ -0,0 +1,11 @@
|
|||
public static void insertSort(int[] A){
|
||||
for(int i = 1; i < A.length; i++){
|
||||
int value = A[i];
|
||||
int j = i - 1;
|
||||
while(j >= 0 && A[j] > value){
|
||||
A[j + 1] = A[j];
|
||||
j = j - 1;
|
||||
}
|
||||
A[j + 1] = value;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,14 @@
|
|||
public static <E extends Comparable<? super E>> void insertionSort(List<E> a) {
|
||||
for (int i = 1; i < a.size(); i++) {
|
||||
int j = Math.abs(Collections.binarySearch(a.subList(0, i), a.get(i)) + 1);
|
||||
Collections.rotate(a.subList(j, i+1), j - i);
|
||||
}
|
||||
}
|
||||
public static <E extends Comparable<? super E>> void insertionSort(E[] a) {
|
||||
for (int i = 1; i < a.length; i++) {
|
||||
E x = a[i];
|
||||
int j = Math.abs(Arrays.binarySearch(a, 0, i, x) + 1);
|
||||
System.arraycopy(a, j, a, j+1, i-j);
|
||||
a[j] = x;
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue