2s complement

Author: ganeshGhode2002

Arrays/linearSearch/binaryNumaddition.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+using namespace std;
+
+int finComplement(int arr[], int n)
+{
+    int m = n + 1;
+    int twoCom[m] = {0};
+
+    for (int i = n - 1, k = m - 1; i > 0; i--, k--)
+    {
+        twoCom[k] = arr[i] == 1 ? 0 : 1;
+    }
+    cout << " 1s` Comp : " << " ";
+    for (int i = 0; i < m; i++)
+    {
+        cout << twoCom[i] << " ";
+    }
+    cout << endl;
+
+    int carry = 1;
+    for (int i = m - 1; i >= 0; i--)
+    {
+        int sum = twoCom[i] + carry;
+        twoCom[i] = sum % 2;
+        carry = sum / 10;
+    }
+    cout<<" 2nd` comp : ";
+    for (int i = 0; i < n + 1; i++)
+    {
+        cout <<twoCom[i] << " ";
+    }
+
+    // return twoCom;
+}
+
+int main()
+{
+    int arr[] = {1, 0, 0, 1, 0, 0, 1,1};
+    int n = 8;
+    cout << "normal arr :  " << " ";
+    for (int i = 0; i < n; i++)
+    {
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+    int ans = finComplement(arr, n);
+
+    // cout << "twos complement : " << " ";
+    // for (int i = 0; i <n+1; i++)
+    // {
+    //     cout << arr[i] << " ";
+    // }
+}

Arrays/linearSearch/binaryNumaddition.exe

@@ -1,28 +1,5 @@
-#include<iostream>
-using namespace std;
-
-int main(){
-    // cout<<"Hello";
-    int j=-1;
-    int n=9;
-    int arr[]={1,1,0,0,1,0,1,0,1};
-
-    for(int i=0;i<n;i++){
-        if(arr[i]==0){
-            j=i;
-            break;
-        }
-    }
-
-    for(int i=j+1;j<n;j++){
-        if(arr[i]!=0){
-            swap(arr[i],arr[j]);
-            j++;
-        }
-    }
-
-    for(int i=0;i<n;i++){
-        cout<<arr[i]<<" ";
-    }
-    return 1;
-}
+  // cout << "first Comp : " << " ";
+    // for (int i = (n + 1); i > 0; i--)
+    // {
+    //     cout << twoCom[i] << " ";
+    // }

Arrays/linearSearch/tempCodeRunnerFile.cpp

@@ -1,4 +1,5 @@
 # Learning Data Structure And Algorithmns From Zero T0  Advanced 
 
 
+