Add files via upload

hackpointer.cpp

@@ -0,0 +1,18 @@
+#include <cmath>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <algorithm>
+#include <functional>&g;
+using namespace std;
+
+
+int main() {
+    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
+    int a,b,c,d;
+    cin>>a>>b;
+    c=a+b;
+    d=abs(a-b);
+cout<<c<<endl<<d;
+    return 0;
+}

ipop.cpp

@@ -0,0 +1,7 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int a,b;
+    cin>>a>>b;
+    cout<<"Value of a and b is: " <<a <<" and " <<b <<endl;
+}

linearsearch.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+int arr[1000],n,key,i;
+for (int i = 0; i < count; i++)
+{
+    /* code */
+}
+
+cout<<"Enter the key to be searched"<<endl;
+cin>>key;
+for (i = 0; i < n; i++)
+{
+    /* code */
+    if(key==arr[i])
+    cout<<key;
+}
+
+return 0;   
+}

maxminarr.c++

@@ -0,0 +1,54 @@
+#include<iostream>
+using namespace std;
+
+
+int getMax(int num[],int n){
+
+int maxi=INT_MIN;
+for (int i = 0; i < n; i++)
+{
+
+    maxi=max(maxi,num[i]);
+    /* 
+    if(num[i]>max)
+    max=num[i];
+    */
+}
+
+    return maxi;
+}
+
+int getMin(int num[],int n){
+int mini=INT_MAX;
+for (int i = 0; i < n; i++)
+{
+
+    mini=min(mini,num[i]);
+    /* 
+    if (num[i]<min)
+    {
+        
+        min=num[i];
+    }
+    */
+
+}
+    return mini;
+}
+
+int main(){
+
+    int size;
+    cin>>size;
+    int num[1000];
+    for (int i = 0; i < size; i++)
+    {
+        /* code */cin>>num[i];
+
+    }
+
+    cout<<"Maximum value is "<<getMax(num, size)<<endl;
+        cout<<"Minimum value is "<<getMin(num, size)<<endl;
+        return 0;
+
+}

operators.cpp

@@ -0,0 +1,6 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+
+}

patt6.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    int i=1;
+    int count=1;
+    while(i<=n){
+        int j=1;
+        while(j<=n)
+        {
+            cout<<count<<" ";
+            count++;
+            j++;
+        }
+        cout<<endl;
+        i++;
+    }
+
+}

sieveoferatosthenes.C++

@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+
+void primeSieve(int n)
+{
+    int prime[100]={0};
+    for(int i=2;i<=n;i++)
+    {
+        if (prime[i]==0)
+        {
+            for(int j=i*i;j<=n;j+=i)
+            prime[j]=1;
+        }
+    }
+    for(int i = 2; i <=n; i++)
+    {
+    if(prime[i]==0)
+        cout<<i<<" ";
+    }
+    cout<<endl;
+}
+
+int main()
+{
+    int n;
+    cin>>n;
+primeSieve(n);
+
+    return 0;
+} 
+

switch.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+int num=2;
+
+cout<<endl;
+switch (num)
+{
+case 1: cout<<"First" <<endl;
+break;
+case 2: cout<<"Second" <<endl;
+//break;
+default: cout<<"character one" <<endl;
+break;
+}
+
+    return 0;
+}

whilesumeven.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+//for sum of all even no.s upto n
+using namespace std;
+int main(){
+
+    int n;
+    cout<<"Enter no. ";
+    cin>>n;
+    int i=2;
+    int sum=0;
+
+    while (i<=n)
+    {
+        sum=sum+i;
+        i=i+2;
+    }
+    cout<<"Value of sum is "<<sum<<endl;
+
+}