FilesExpand file tree

 master

/

SelectionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (35 loc) · 1.54 KB

 master

/

SelectionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (35 loc) · 1.54 KB

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

33

34

35

36

37

package sorting.algorithms;

/**

* Comparison sort with O(n2) timing complexity making in-efficient on large sets.

* In this algorithm the element on active position (say ith position) is compared with other positions

* (say i+1th to nth position) and swaps if it's larger than the compared element. The compared element then becomes

* the active element.

* In this algorithm, a minimal element is found in the list and put in the start of the list.

*

* User: rpanjrath

* Date: 8/20/13

* Time: 2:54 PM

*/

public class SelectionSort {

public int[] sort(int[] inputArray) {

int arraylength = inputArray.length;

int minIndex; // Current array index considered to be holding minimum value. Will be updated if other index holding lower value is found.

int temp; // used for swapping.

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

minIndex = i;

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

if (inputArray[j] < inputArray[minIndex]) {

minIndex = j; // since index j is holding lower value, update minIndex to j.

}

}

// Now minIndex is actually holding the lowest value in current sub-array.

// if minIndex is i itself then dont swap. It means in the beginning only the selected element was smallest.

if (minIndex != i) {

temp = inputArray[i];

inputArray[i] = inputArray[minIndex];

inputArray[minIndex] = temp;

}

}

return inputArray;

}

}