8000 udpate insertion sort by realDuYuanChao · Pull Request #2176 · TheAlgorithms/Java · GitHub
[go: up one dir, main page]
Skip to content

udpate insertion sort #2176

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
realDuYuanChao merged 2 commits into from
Apr 12, 2021
Merged

udpate insertion sort #2176

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
7b21545
udpate insertion sort
realDuYuanChao Apr 12, 2021
b005ff9
Formatted with Google Java Formatter
Apr 12, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
44 changes: 15 additions & 29 deletions Sorts/InsertionSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,53 +3,39 @@
import static Sorts.SortUtils.less;
import static Sorts.SortUtils.print;

/**
* @author Varun Upadhyay (https://github.com/varunu28)
* @author Podshivalov Nikita (https://github.com/nikitap492)
*/
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
public <T extends Comparable<T>> T[] sort(T[] array) {
for (int j = 1; j < array.length; j++) {

// Picking up the key(Card)
T key = array[j];
int i = j - 1;

while (i >= 0 && less(key, array[i])) {
array[i + 1] = array[i];
i--;
for (int i = 1; i < array.length; i++) {
T insertValue = array[i];
int j;
for (j = i - 1; j >= 0 && less(insertValue, array[j]); j--) {
array[j + 1] = array[j];
}
if (j != i - 1) {
array[j + 1] = insertValue;
}
// Placing the key (Card) at its correct position in the sorted subarray
array[i + 1] = key;
}
return array;
}

// Driver Program
/** Driver Code */
public static void main(String[] args) {
// Integer Input
Integer[] integers = {4, 23, 6, 78, 1, 54, 231, 9, 12};

InsertionSort sort = new InsertionSort();

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"};

sort.sort(strings);

// Output => a b c d e
print(strings);
print(strings); /* [a, b, c, d, e] */
}
}
0