Add files via upload

Author: skjha1

Array/27 Find a pair with sum k.cpp

@@ -0,0 +1,30 @@
+#include<iostream>
+using namespace std;
+int main ()
+{
+	int A[10]={1,2,4,5,6,8,10,12,14,15};
+	int n =sizeof(A)/sizeof(int);
+	int k=10 ;// sum of pair of element is 10
+	int i,j;
+	i=0;
+	j=n-1;	
+	while (i<j)
+	{
+	
+			if (A[i]+A[j]==k)
+			{
+				cout<<A[i] <<"+"<<A[j]<<"="<<k<<endl;
+				i++;
+				j--;
+			}
+			else if (A[i]+A[j]<k) 
+			{
+			i++;
+			} // increment i if the sum of two element is less than k
+			else
+			j--;//decremnt j if the sum of two elements is greater than k
+		}
+
+	cout<<endl;
+	return 0;
+}

Array/28 Find a pair with sum k in unsorted.cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std ;
+int main ()
+{
+	int i,j;
+	int  A[10]={2,3,1,8,6,7,9,1,5,4};
+	int k=10;
+	int n=sizeof(A)/sizeof(int);
+	
+	for (i=0;i<n;i++)
+	{
+		for (j=i+1;j<n;j++)
+		{
+			if (A[i]+A[j]==k)
+			cout <<A[i]<<"+"<<A[j]<<"="<<k<<endl;
+		}
+	}
+	return 0;
+}
+// time complexity is o(n^2)

Array/29 Find a pair with sum k using Hashing.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main ()
+{
+	int A[10]={1,6,2,4,5,10,11,12,3,7};
+	int k=10;
+	int H[20]={0};  // Initialize the size of hashing array with the largest element in array A ;
+	int n= sizeof(A)/sizeof(int);
+	
+	for (int i=0;i<n;i++)
+	{
+		if (H[k-A[i]]!=0 && k-A[i]>=0 )
+		cout<<A[i]<<"+"<<k-A[i]<<"="<<k<<endl;
+		H[A[i]]++;
+		
+	}
+	return 0;
+}