FilesExpand file tree

 master

/

InsertionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

63 lines (53 loc) · 1.57 KB

 master

/

InsertionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

63 lines (53 loc) · 1.57 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

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

/**

*

* @author Varun Upadhyay (https://github.com/varunu28)

*

*/

class InsertionSort {

/**

* This method implements the Generic Insertion Sort

*

* @param array The array to be sorted

* @param last The count of total number of elements in array

* Sorts the array in increasing order

**/

public static <T extends Comparable<T>> void IS(T array[], int last) {

T key;

for (int j=1;j<last;j++) {

// Picking up the key(Card)

key = array[j];

int i = j-1;

while (i>=0 && key.compareTo(array[i]) < 0) {

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

i--;

}

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

array[i+1] = key;

}

}

// Driver Program

public static void main(String[] args) {

// Integer Input

int[] arr1 = {4,23,6,78,1,54,231,9,12};

int last = arr1.length;

Integer[] array = new Integer[arr1.length];

for (int i=0;i<arr1.length;i++) {

array[i] = arr1[i];

}

IS(array, last);

// Output => 1 4 6 9 12 23 54 78 231

for (int i=0;i<array.length;i++) {

System.out.print(array[i] + " ");

}

System.out.println();

// String Input

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

last = array1.length;

IS(array1, last);

//Output => a b c d e

for(int i=0; i<last; i++)

{

System.out.print(array1[i]+"\t");

}

}

}