diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-30 00:18:17 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-30 00:18:17 +0200 |
| commit | 3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch) | |
| tree | 474b08b187895af91c10838aae21142b2ba2514d /CountingSort2/CountingSort2.cpp | |
| parent | f5ff62a26052f084b6b807cba220c86785fd45e3 (diff) | |
| download | competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip | |
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'CountingSort2/CountingSort2.cpp')
| -rw-r--r-- | CountingSort2/CountingSort2.cpp | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/CountingSort2/CountingSort2.cpp b/CountingSort2/CountingSort2.cpp new file mode 100644 index 0000000..29fb91c --- /dev/null +++ b/CountingSort2/CountingSort2.cpp @@ -0,0 +1,21 @@ +#include<bits/stdc++.h> + +using namespace std; + +int main() { + int n, x; + cin >> n; + vector<int> v; + vector<int> freq(100); + for(int i = 0; i < n; i ++){ + cin >> x; + freq[x]+=1; + } + for(int i = 0; i < freq.size(); i++){ + for(int j = 0; j < freq[i]; j++){ + cout << i << " "; + } + } + cout << endl; + return 0; +} |
