aboutsummaryrefslogtreecommitdiff
path: root/CountingSort2.cpp
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /CountingSort2.cpp
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-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.cpp')
-rw-r--r--CountingSort2.cpp21
1 files changed, 0 insertions, 21 deletions
diff --git a/CountingSort2.cpp b/CountingSort2.cpp
deleted file mode 100644
index 29fb91c..0000000
--- a/CountingSort2.cpp
+++ /dev/null
@@ -1,21 +0,0 @@
-#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;
-}