FilesExpand file tree

 master

/

InsertionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (36 loc) · 1.04 KB

 master

/

InsertionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (36 loc) · 1.04 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

38

39

40

41

package Sorts;

import static Sorts.SortUtils.less;

import static Sorts.SortUtils.print;

class InsertionSort implements SortAlgorithm {

/**

* Generic insertion sort algorithm in increasing order.

*

* @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 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;

}

}

return array;

}

/** Driver Code */

public static void main(String[] args) {

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] */

String[] strings = {"c", "a", "e", "b", "d"};

sort.sort(strings);

print(strings); /* [a, b, c, d, e] */

}

}