-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathInsertionSort.java
More file actions
43 lines (36 loc) · 1.15 KB
/
InsertionSort.java
File metadata and controls
43 lines (36 loc) · 1.15 KB
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
package Sorting;
import java.util.*;
public class InsertionSort {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter the Size of the Array: ");
int size = sc.nextInt();
int array[] = new int[size];
//for input
System.out.print("Enter the array element: ");
for(int i=0; i<size; i++){
array[i] = sc.nextInt();
}
//for output
System.out.print("Print the array element: ");
for(int i=0; i<size; i++){
System.out.print(" "+ array[i]);
}
System.out.println();
// Selection Sort
System.out.println("Sorted array element using Insertion Sorting: ");
for(int i=1; i<array.length; i++) {
int current = array[i];
int j = i - 1;
while(j >= 0 && array[j] > current) {
//Keep swapping
array[j+1] = array[j];
j--;
}
array[j+1] = current;
}
for(int i=0; i<size; i++){
System.out.print(array[i]+" ");
}
}
}