forked from pratyushmp/code_opensource_2020
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertion.java
More file actions
48 lines (45 loc) · 1.44 KB
/
Insertion.java
File metadata and controls
48 lines (45 loc) · 1.44 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
44
45
46
47
48
/*RockLee444*/
import java.util.Scanner;
public class Insertion{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int[] data = new int[1]; //Initializing array
int size=0,error=0; //Initializing variables
do{
error=0;
System.out.println("How many numbers do you wish to sort?");
size = sc.nextInt();
if(size>0){
data = new int[size];
for(int i=0;i<size;i++){
System.out.println("Add a number.");
data[i]=sc.nextInt();
}
}
else {
error=1;
}
}while(error!=0);
sc.close();
insertion(data,size);
}
public static void insertion(int[] data,int size){
int aux,j;
for(int i=1;i<size;i++){
j=i;
aux=data[i];
while(j>0 && aux<data[j-1]){
data[j] = data[j-1];
j--;
}
data[j] = aux;
}
visualize(data, size);
}
public static void visualize(int data[],int size){
System.out.println("\t*******Sorted array:*******");
for(int i=0;i<size;i++){
System.out.println("Number in position " + i + ": " + data[i]);
}
}
}