FilesExpand file tree

 main

/

InsetionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

30 lines (28 loc) · 975 Bytes

 main

/

InsetionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

30 lines (28 loc) · 975 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

class InsetionSort {

static void insertionSort(int[] arr){

for(int i = 1; i < arr.length-1; i++){

int currElement = arr[i];

int prevIdx = i - 1;

//sorting elements in sortedPart of array from unsortedPart of array

while (prevIdx >= 0 && arr[prevIdx] > currElement) {

arr[prevIdx+1] = arr[prevIdx];

prevIdx--;

}

//placing element in right position of sortedPart of array

arr[prevIdx+1] = currElement;

}

}

public static void main(String[] args) {

int[] arr = {45,50,5,1,20};

System.out.println("Array before Insertion sort : ");

for(int val : arr){

System.out.print(val + " ");

}

System.out.println();

insertionSort(arr);

System.out.println("Array after Insertion sort : ");

for(int val : arr){

System.out.print(val + " ");

}

}

}