-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSort_012.java
60 lines (55 loc) · 1.22 KB
/
Sort_012.java
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
50
51
52
53
54
55
56
57
58
59
60
import java.util.Scanner;
public class Sort_012 {
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
int N=s.nextInt();
int arr[] = new int[N];
for(int i=0;i<=N-1;i++)
{
arr[i]=s.nextInt();
}
int NoZero=0;
int NoOne=0;
int NoTwo=0;
for(int i=0;i<=N-1;i++)
{
if(arr[i]==0)
{
NoZero+=1;
}
if(arr[i]==1)
{
NoOne+=1;
}
if(arr[i]==2)
{
NoTwo+=1;
}
}
if(NoZero>0) {
for (int i = 0; i < NoZero ; i++) {
arr[i]=0;
}
}
if(NoOne>0)
{
for(int i=NoZero;i<(NoZero+NoOne);i++)
{
arr[i]=1;
}
}
if(NoTwo>0)
{
for(int i=(NoZero+NoOne);i<N;i++)
{
arr[i]=2;
}
}
System.out.print("Sorted Array is ");
for(int j=0;j<=N-1;j++)
{
System.out.print(arr[j]+" ");
}
}
}