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

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
Sorts/SelectionSort.java
View File

@ -1,12 +1,9 @@
package Sorts;
/**
*
* @author Varun Upadhyay (https://github.com/varunu28)
* @author Podshivalov Nikita (https://github.com/nikitap492)
*
* @see SortAlgorithm
*
*/
public class SelectionSort implements SortAlgorithm {
@ -15,7 +12,7 @@ public class SelectionSort implements SortAlgorithm {
* This method implements the Generic Selection Sort
*
* @param arr The array to be sorted
* Sorts the array in increasing order
* Sorts the array in increasing order
**/
@Override
public <T extends Comparable<T>> T[] sort(T[] arr) {
@ -24,7 +21,7 @@ public class SelectionSort implements SortAlgorithm {
// Initial index of min
int min = i;
for (int j = i +1 ; j < n; j++) {
for (int j = i + 1; j < n; j++) {
if (SortUtils.less(arr[j], arr[min])) {
min = j;
}
@ -32,7 +29,7 @@ public class SelectionSort implements SortAlgorithm {
// Swapping if index of min is changed
if (min != i) {
SortUtils.swap(arr, i , min);
SortUtils.swap(arr, i, min);
}
}
@ -52,7 +49,7 @@ public class SelectionSort implements SortAlgorithm {
SortUtils.print(sorted);
// String Input
String[] strings = {"c", "a", "e", "b","d"};
String[] strings = {"c", "a", "e", "b", "d"};
String[] sortedStrings = selectionSort.sort(strings);
//Output => a b c d e