practice 25-Jan-2020

Author: sureshmangs

algorithms/searching/linear_search.cpp

@@ -0,0 +1,26 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int linearSearch(int a[],int n, int item){
+    for(int i=0;i<n;i++){
+        if(a[i]==item) return i;
+    }
+    return -1;
+}
+
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int n;
+    cin>>n;
+    int a[n];
+    for(int i=0;i<n;i++) cin>>a[i];
+    int item;
+    cin>>item;
+    int index=linearSearch(a,n,item);
+    if(index>=0) cout<<"Found at index "<<index;
+    else cout<<"Not found";
+
+return 0;
+}

array/array pair sum.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    int a[n];
+    for(int i=0;i<n;i++){
+        cin>>a[i];
+    }
+    unordered_set<int> s;
+    int sum;
+    cin>>sum;
+    for(int i=0;i<n;i++){
+        if(s.find(sum-a[i])!=s.end()){
+            cout<<sum-a[i]<<" "<<a[i]<<endl;
+        }
+        else {
+            s.insert(a[i]);
+        }
+    }
+}
+