FilesExpand file tree

 master

/

InsertionSort.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

46 lines (37 loc) · 1.13 KB

 master

/

InsertionSort.java

Top

File metadata and controls

• Code
• Blame

46 lines (37 loc) · 1.13 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

import java.util.Scanner;

public class InsertionSort

{

public static void sort( int arr[] )

{

int N = arr.length;

int i, j, temp;

for (i = 1; i< N; i++)

{

j = i;

temp = arr[i];

while (j > 0 && temp < arr[j-1])

{

arr[j] = arr[j-1];

j = j-1;

}

arr[j] = temp;

}

}

public static void main(String[] args)

{

Scanner scan = new Scanner( System.in );

System.out.println("Insertion Sort Test\n");

int n, i;

System.out.println("Enter number of integer elements");

n = scan.nextInt();

int arr[] = new int[ n ];

System.out.println("\nEnter "+ n +" integer elements");

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

arr[i] = scan.nextInt();

sort(arr);

System.out.println("\nElements after sorting ");

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

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

System.out.println();

}

}