FilesExpand file tree

 master

/

InsertionSort.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

45 lines (37 loc) · 1 KB

 master

/

InsertionSort.java

Top

File metadata and controls

• Code
• Blame

45 lines (37 loc) · 1 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

package com.patil.software.solutions;

//Java program for implementation of Insertion Sort

public class InsertionSort {

/* Function to sort array using insertion sort */

void sort(int arr[]) {

int n = arr.length;

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

int key = arr[i];

int j = i - 1;

/*

* Move elements of arr[0..i-1], that are greater than key, to one position

* ahead of their current position

*/

while (j >= 0 && arr[j] > key) {

arr[j + 1] = arr[j];

j = j - 1;

}

arr[j + 1] = key;

printArray(arr);

}

}

/* A utility function to print array of size n */

static void printArray(int arr[]) {

int n = arr.length;

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

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

System.out.println();

}

// Driver method

public static void main(String args[]) {

int arr[] = { 12, 11, 13, 5, 6 };

InsertionSort ob = new InsertionSort();

ob.sort(arr);

printArray(arr);

}

};

/* This code is contributed by Rajat Mishra. */