From b41adc29f7ab749c4cc220331e13a2b1b9e20c1e Mon Sep 17 00:00:00 2001
From: Soumyadeep Das <96656148+soumyadeepdas28@users.noreply.github.com>
Date: Tue, 26 Jul 2022 20:04:11 +0530
Subject: [PATCH] Add files via upload

---
 Q1_CP.cpp | 46 ++++++++++++++++++++++++++++++++++++++++++++++
 Q2_CP.cpp | 36 ++++++++++++++++++++++++++++++++++++
 README.md | 26 +++-----------------------
 3 files changed, 85 insertions(+), 23 deletions(-)
 create mode 100644 Q1_CP.cpp
 create mode 100644 Q2_CP.cpp

diff --git a/Q1_CP.cpp b/Q1_CP.cpp
new file mode 100644
index 0000000..4f46bfa
--- /dev/null
+++ b/Q1_CP.cpp
@@ -0,0 +1,46 @@
+#include<bits/stdc++.h>
+#define MAX 100
+using namespace std;
+int main()
+{
+    int a1[MAX];
+    int a2[MAX];
+    int n;
+    cout<<"\n Enter the size of an array:-";
+    cin>>n;
+    int i;
+    cout<<"\n Enter the element of an array:-\n";
+    for(i=0;i<n;i++)
+    {
+        cin>>a1[i];
+    }
+    int ind=0;
+    //EVEN NUMBER
+    for(i=0;i<n;i++)
+    {
+        if(a1[i]%2==0)
+        {
+            a2[ind]=a1[i];
+            ind++;
+        }
+
+    }
+    //ODD NUMBER
+    for(i=0;i<n;i++)
+    {
+        if(a1[i]%2==1)
+        {
+            a2[ind]=a1[i];
+            ind++;
+        }
+
+    }
+cout<<"\n***************OUTPUT******************\n";
+     for(i=0;i<n;i++)
+    {
+        cout<<a2[i]<<"\t";
+    }
+
+return 0;
+
+}
diff --git a/Q2_CP.cpp b/Q2_CP.cpp
new file mode 100644
index 0000000..cae48ab
--- /dev/null
+++ b/Q2_CP.cpp
@@ -0,0 +1,36 @@
+#include<iostream>
+#include<stdio.h>
+using namespace std;
+#define MAX 100
+int main()
+{
+    int arr[MAX];
+    int i,j,n,c=0;
+    cout<<"Enter the Size of the Array\n";
+    cin>>n;
+    cout<<"Enter the elements of an array\n";
+    for(i=0;i<n;i++)
+    {
+        cin>>arr[i];
+    }
+    for(i=0;i<=9;i++)
+    {
+        c=0;
+        for(j=0;j<n;j++)
+        {
+            if(i==arr[j])
+            {
+                c++;
+            }
+        }
+        if(c!=0)
+        {
+            cout<<i<<"-"<<c;
+            cout<<"\n";
+        }
+
+    }
+
+
+    return 0;
+}
\ No newline at end of file
diff --git a/README.md b/README.md
index 0f36214..bf5bd04 100644
--- a/README.md
+++ b/README.md
@@ -1,23 +1,3 @@
-# Competitive Programming Assignment
-
-Solve the following problems:
-1. Given an array of size n arrange the array in such a way that all even numbers comes before all odd numbers and the order should be maintained
-Example - 13 25 6 24 45 2
-Output - 6 24 2 13 25 45
-
-
-2. Given an array of size n print the array element and it's frequency. (Order not mandatory) 
-Example - 2 4 2 2 3 3 3 5
-Output:
-2 - 3
-3 - 3
-4 - 1
-5 - 1
-
-# Instructions to upload
-
-- Fork the repository
-- Create a new branch (with your name)
-- Upload files in the new branch.
-- Create a pull request.
-
+# Soumyadeep Das 
+# BCA 1B 
+# 211001102090