FilesExpand file tree

 master

/

InsertionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (44 loc) · 725 Bytes

 master

/

InsertionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (44 loc) · 725 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

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

import java.util.Scanner;

/**

* This class implements Insertion Sort

*

* @author Unknown

*

*/

class InsertionSort

{

/**

* Main Method

*

* @param args Command line arguments

*/

public static void main(String[] args)

{

int array[]=new int[6];

Scanner input=new Scanner(System.in);

//Input

System.out.println("Enter any 6 Numbers for Unsorted Array : ");

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

{

array[i]=input.nextInt();

}

//Sorting

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

{

int temp=array[i];

int j=i-1;

while(j>=0 && temp<array[j] )

{

array[j+1]=array[j];

j--;

}

array[j+1]=temp;

}

//Output

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

{

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

}

input.close();

}

}