FilesExpand file tree

 Development

/

SelectionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (28 loc) · 815 Bytes

 Development

/

SelectionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (28 loc) · 815 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

package com.sorts;

import static com.sorts.SortUtils.less;

import static com.sorts.SortUtils.swap;

public class SelectionSort {

/**

* This method implements the Generic Selection Sort

*

* @param arr The array to be sorted

* Sorts the array in increasing order

**/

public <T extends Comparable<T>> T[] sort(T[] arr) {

int n = arr.length;

for (int i = 0; i < n - 1; i++) {

// Initial index of min

int min = i;

for (int j = i + 1; j < n; j++) {

if (less(arr[j], arr[min])) {

min = j;

}

}

// Swapping if index of min is changed

if (min != i) {

swap(arr, i, min);

}

}

return arr;

}

}