better method for findPairofNumbersToAddUpToAnother

Author: kotAPI

Arrays and Strings/C++/findPairofNumbersToAddUpToAnother.cpp

@@ -21,14 +21,18 @@ using namespace std;
 //Prototypes for the algorithms
 void findPairofNumbersToAddUpToAnother(int* ,int, int);
 
+// For method 2;
+void findPairofNumbersToAddUpToAnother_optimized(int* arr,int len, int targetAdditionSum);
+void someSortingAlgorithm(int* arr,int length);
+
 int main(){
 // Lines to handle user input go here, be descriptive...
 // use cin, cout 
-int arr[] = {2,4,5,7,1,3};
-int additionNumber = 12;
+int arr[] = {1,2,5,5,15,22,55};
+int additionNumber = 20;
 int arrayLength = sizeof(arr)/sizeof(arr[0]);
 // Call your algorithms here
-findPairofNumbersToAddUpToAnother(arr, arrayLength, additionNumber);
+findPairofNumbersToAddUpToAnother_optimized(arr, arrayLength, additionNumber);
 
 
 
@@ -60,3 +64,52 @@ void findPairofNumbersToAddUpToAnother(int* arr,int len, int targetAdditionSum){
 
 
 }
+
+
+/**********************************************************
+/* <findPairofNumbersToAddUpToAnother>
+/*
+/* @description : description here
+/* @param : Integer<variable> (Datatype<variable_name>)
+/* @return : datatype (int,float,double etc)
+/* @complexity : Big O notation. (O(n),O(n^2) etc)
+/* @explanation : Detailed description about what the algorithm does
+/* @author : <Your name> @<GitHub handle> (John Doe @johndoe)
+/**********************************************************/
+void findPairofNumbersToAddUpToAnother_optimized(int* arr,int len, int targetAdditionSum){
+
+int left=0;
+int right=len-1;
+
+someSortingAlgorithm(arr,len);
+
+while(left<right){
+if(arr[left]+arr[right] > targetAdditionSum){
+right--;
+}
+if(arr[left]+arr[right] < targetAdditionSum){
+left++;
+}
+if(arr[left]+arr[right] == targetAdditionSum){
+
+cout<<"Pair found :"<<arr[left]<< " "<<arr[right]<<endl;
+right--;
+left++;
+}
+
+}
+}
+
+
+// Need this for Method 2, coz this optimized method only works for a sorted array.
+void someSortingAlgorithm(int* arr,int length){
+for(int i=0;i<length;i++){
+for(int j=i+1;j<length;j++){
+if(arr[i]>arr[j]){
+int temp=arr[i];
+arr[i] = arr[j];
+arr[j] = temp;
+}
+}
+}
+}

Arrays and Strings/C++/segregateEvenOdd.cpp

@@ -1,4 +1,7 @@
 
+
+
+
 /*******************************************************************************************************
 /* ___ _ _ _ _ 
 /* / _ \ | | (_)| | | | 
@@ -27,9 +30,7 @@ int main(){
 int arr[] = {12, 34, 45, 9, 8, 90, 3,22, 31, 991, 112, 366, 424,411, 565, 566};
 int arrayLength = sizeof(arr)/sizeof(arr[0]);
 // Call your algorithms here
-segregateEvenOdd(arr, arrayLength);
-
-
+segregateEvenOdd(arr, arrayLength);
 
 return 0;
 }
@@ -60,11 +61,10 @@ int segregateEvenOdd(int* arr,int len){
 int temp = arr[left];
 arr[left] = arr[right];
 arr[right] = temp;
-}
-
-
+}
 }
 
+//Print the numbers
 for(int i=0;i<len;i++){
 cout<<arr[i]<<" ";
 }