mid-update

Author: Mohit Jain

.DS_Store

@@ -0,0 +1,75 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+
+void countSort(int *a, int n,int *result) {
+
+
+int mx = *max_element(a,a+n);
+
+int *count =  new int[mx];
+
+memset(count, 0, mx);
+
+for(int i = 0; i < n ; i ++) {
+	count[a[i]]++;
+}
+int res=0,lop=0;
+
+while(lop<= mx) {
+ if(count[lop]> 0) {
+ 	// cout<<count[a[lop]]<<"dd"<<a[lop];
+ 	result[res] = lop;
+ 	res++;
+ 	count[lop]--;
+
+ 	 } else {
+ 	 	lop++;
+ 	 }
+
+}
+
+
+}
+
+
+
+
+int main() {
+    
+    
+  #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+  #endif
+
+    int n; 
+
+    cin>>n;
+
+    int *a = new int[n];
+
+
+    for(int i=0; i < n ; i ++) {
+
+         cin>>a[i];
+
+    }
+
+    int *result = new int[n];
+
+        countSort(a, n, result);
+
+    for(int i=0; i < n ; i ++) {
+
+        cout<<result[i]<<" ";
+
+    }
+
+
+	return 0;
+}

84d8f91a-1505-4a1e-ac8c-007fb2a1fb5e.pointersandmemorypdf

@@ -0,0 +1,27 @@
+#include<iostream>
+
+using namespace std;
+
+
+int decimalToBinary(int n) {
+
+  int ans =0 ;
+
+  int p =1;
+
+  while(n > 0) {
+  	int last_bit = (n & 1);
+
+  	ans+ = p* last_bit;
+
+  	p = p*10;
+
+  	n = n >>1;
+  }
+
+  return ans;
+
+
+
+
+}

Computer_vision_techniques_for_forest_fire_percept.pdf

@@ -0,0 +1,64 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+
+
+void sortLinear(int *a, int n) {
+
+ int low = 0;
+
+ int mid = 0;
+
+ int high = n-1;
+
+
+ while ( mid <= high )  {
+
+   if(a[mid] ==0) {
+   	swap(a[low],a[mid]);
+   	low++;mid++;
+   } else if (a[mid] == 1) {
+
+   	mid++;
+   } else {
+
+   	    swap(a[mid],a[high]);
+   	    high--;
+   }
+}
+
+
+ }
+
+
+int main() {
+  
+  #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+#endif
+
+  int n;
+
+  cin>>n;
+
+  int *a = new int[n];
+
+  for (int i =0; i< n ; i ++) {
+
+  	cin>>a[i];
+  }
+
+   sortLinear(a,n);
+   for (int j =0; j < n; j ++) {
+
+	cout<<a[j]<<endl;
+   }
+
+return 0;
+
+}

CountSort

@@ -0,0 +1,69 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// {5 6} 0110, 0101  tries // for fun // bit 
+//manipulation for fun
+// { 5^6, 5^5, 6^6} = 3 
+int max_xor(int arr[] , int n) {
+
+   int mask = 0;
+
+   int ans = 0;
+
+   int i,j;
+
+   for(i = 31; i>=0; i--) {
+
+   	mask = mask | (1<<i); // eg 0010
+   	set<int> s;
+
+   	for(j =0; j<n; j++) 
+   	{
+   		s.insert((arr[j] & mask));
+
+             // either 100000 or 00000
+         // 0000 0100 0010 
+   	}
+   	int candidate = ans | (1<<i); // 0100 | 0010
+       // 0110
+   	set<int> ::iterator it;
+   	for(it = s.begin(); it!=s.end();it++){
+   		if(s.find(*it^candidate) != s.end() ){
+            // 0100
+   			ans = candidate; // 0110
+   			break;
+   		}
+   	}
+   }
+
+   return ans;
+
+}
+
+int main() {
+    
+    #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+  #endif
+  
+     int x,y;
+
+	 cin>>x>>y;
+
+
+    
+      int n =  (y-x) + 1;
+     int *a = new int[n];
+     int j =0;
+	 for(int i=x; i <= y; i++)    {
+
+        a[j++] = i;
+	 }
+
+	 cout<<max_xor(a,n)<<endl;
+
+	 return 0;
+}

CountSort.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+
+int main() {
+     #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+#endif
+
+    long long int value;
+    vector<long long int> inputs;
+	while(cin>>value){
+		cout<<value;
+        inputs.push_back(value);
+	}
+	int q = inputs[inputs.size()-1];
+    
+    long long int ans = 1;
+
+    for(int i=0; i<inputs.size()-1;i++){
+    	ans = ans*inputs[i];
+    }
+     auto loopEnd = max_element(inputs.begin(), inputs.end()-1);
+    for(int i=0; i <loopEnd ;  )
+
+
+	return 0;
+}

DecimaalToBinary.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+
+using namespace std;
+
+
+// Replace bits in N by M
+
+// You are given two 32- bit numbers, N and M two bit positions, i and j. 
+// Write a method to set all bits between i and j in N equal to M 
+// (e.g., M becomes a substring of N located at i and starting at j).
+
+// EXAMPLE:
+// Input: N = 10000000000,
+// M = 10101, i = 2, j = 6
+
+// Output: N = 10001010100
+
+// for this we have to first cleard the range of bits from range i to j
+// and then or with m left shift i. 
+
+int clearRangeItoJ(int n, int i, int j) {
+
+	int ones = (~0);
+	int a = ones<<(j+1);
+	int b = (1<<i) - 1;
+
+	int mask = a|b;
+
+	int ans = n&mask;
+
+	return ans;
+}
+
+int replaceBits(int n, int m, int i, int j) {
+	int n_ = clearRangeItoJ(n,i,j);
+
+	int ans = n_ | (m << i);
+
+	return ans;
+}
+
+int main() {
+
+  #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+  #endif
+  
+    int n = 15;
+
+    int i = 1, j = 4;
+
+    int m = 5;
+
+    int ans = replaceBits(n,m,i,j);
+   
+   cout<<ans<<endl;
+
+   return 0;
+}