DSA-Dotquestionmark/Sort_arr_012.cpp at main · Fairly-fire/DSA-Dotquestionmark · GitHub

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
61
62
63
64
65
66
67
//https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1/?problemStatus=solved&page=1&query=problemStatussolvedpage1

#include<bits/stdc++.h>
using namespace std;


 // } Driver Code Ends
class Solution
{
    public:
    void sort012(int a[], int n)
    {
        // coode here

    int count0=0,count1=0,count2=0;
    for(int i=0;i<n;i++){
        if(a[i]==0)
            count0++;
        else if (a[i]==1)
            count1++;
        else
            count2++;
    }
    int j=0;
    for(int i=0;i<count0;i++){
        a[j++]=0;
    }
    for(int i=0;i<count1;i++){
        a[j++]=1;
    }
    for(int i=0;i<count2;i++){
        a[j++]=2;
    }
    }

};

// { Driver Code Starts.
int main() {

    int t;
    cin >> t;

    while(t--){
        int n;
        cin >>n;
        int a[n];
        for(int i=0;i<n;i++){
            cin >> a[i];
        }

        Solution ob;
        ob.sort012(a, n);

        for(int i=0;i<n;i++){
            cout << a[i]  << " ";
        }

        cout << endl;


    }
    return 0;
}

  // } Driver Code Ends