algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-08 18:32:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

udpate insertion sort (#2176)

Browse Source 
* udpate insertion sort

* Formatted with Google Java Formatter

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Du Yuanchao
2021-04-12 18:58:24 +08:00
committed by GitHub
parent 6dd5b2029e
commit d93ee0de2d
1 changed files with 15 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
Sorts/InsertionSort.java
View File

@ -3,53 +3,39 @@ package Sorts;
import static Sorts.SortUtils.less; import static Sorts.SortUtils.less;
import static Sorts.SortUtils.print; import static Sorts.SortUtils.print;
/**
* @author Varun Upadhyay (https://github.com/varunu28)
* @author Podshivalov Nikita (https://github.com/nikitap492)
*/
class InsertionSort implements SortAlgorithm { class InsertionSort implements SortAlgorithm {
/** /**
* This method implements the Generic Insertion Sort Sorts the array in increasing order * Generic insertion sort algorithm in increasing order.
* *
* @param array The array to be sorted * @param array the array to be sorted.
* @param <T> the class of array.
* @return sorted array.
*/ */
@Override @Override
public <T extends Comparable<T>> T[] sort(T[] array) { public <T extends Comparable<T>> T[] sort(T[] array) {
for (int j = 1; j < array.length; j++) { for (int i = 1; i < array.length; i++) {
T insertValue = array[i];
// Picking up the key(Card) int j;
T key = array[j]; for (j = i - 1; j >= 0 && less(insertValue, array[j]); j--) {
int i = j - 1; array[j + 1] = array[j];
}
while (i >= 0 && less(key, array[i])) { if (j != i - 1) {
array[i + 1] = array[i]; array[j + 1] = insertValue;
i--;
} }
// Placing the key (Card) at its correct position in the sorted subarray
array[i + 1] = key;
} }
return array; return array;
} }
// Driver Program /** Driver Code */
public static void main(String[] args) { public static void main(String[] args) {
// Integer Input
Integer[] integers = {4, 23, 6, 78, 1, 54, 231, 9, 12}; Integer[] integers = {4, 23, 6, 78, 1, 54, 231, 9, 12};
InsertionSort sort = new InsertionSort(); InsertionSort sort = new InsertionSort();
sort.sort(integers); sort.sort(integers);
print(integers); /* [1, 4, 6, 9, 12, 23, 54, 78, 231] */
// Output => 1 4 6 9 12 23 54 78 231
print(integers);
// String Input
String[] strings = {"c", "a", "e", "b", "d"}; String[] strings = {"c", "a", "e", "b", "d"};
sort.sort(strings); sort.sort(strings);
print(strings); /* [a, b, c, d, e] */
// Output => a b c d e
print(strings);
} }
} }