FilesExpand file tree

 Development

/

InsertionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (23 loc) · 633 Bytes

 Development

/

InsertionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (23 loc) · 633 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

package com.sorts;

public class InsertionSort {

/**

* This method implements the Generic Insertion Sort

* Sorts the array in increasing order

*

* @param array The array to be sorted

**/

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 && SortUtils.less(key, array[i])) {

array[i + 1] = array[i];

i--;

}

// Placing the key (Card) at its correct position in the sorted subarray

array[i + 1] = key;

}

return array;

}

}