FilesExpand file tree

 master

/

InsertionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (29 loc) · 997 Bytes

 master

/

InsertionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

31 lines (29 loc) · 997 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

package sorting.algorithms;

/**

* March up the array, checking each element. If larger (than what's in previous position checked), leave it. If

* smaller then march back down, shifting larger elements up until encounter a smaller element. Insert there.

*

* http://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif

*

* User: rpanjrath

* Date: 8/20/13

* Time: 2:55 PM

*/

public class InsertionSort {

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

int arrayLength = inputArray.length;

int temp;

int j;

for (int i = 1; i < arrayLength; i++) {

temp = inputArray[i];

j = i;

// Keep on moving the element to the left of the list till its greater than current element in comparison.

while (j > 0 && inputArray[j - 1] > temp) {

inputArray[j] = inputArray[j - 1];

j--;

}

inputArray[j] = temp;

}

return inputArray;

}

}