Merge pull request #38 from sakshi1432/patch-5

Finds missing elements in a range in array

Author: ashish-ratn

missing-elem-range.cpp

@@ -0,0 +1,31 @@
+// A hashing based C++ program to find missing 
+// elements from an array 
+#include<bits/stdc++.h> 
+using namespace std; 
+  
+// Print all elements of range [low, high] that 
+// are not present in arr[0..n-1] 
+void printMissing(int arr[], int n, int low, 
+                                   int high) 
+{ 
+   // Insert all elements of arr[] in set 
+   unordered_set<int> s; 
+   for (int i=0; i<n; i++) 
+      s.insert(arr[i]); 
+  
+   // Traverse throught the range an print all 
+   // missing elements 
+   for (int x=low; x<=high; x++) 
+      if (s.find(x) == s.end()) 
+         cout << x << " "; 
+} 
+  
+// Driver program 
+int main() 
+{ 
+   int arr[] = {1, 3, 5, 4}; 
+   int n = sizeof(arr)/sizeof(arr[0]); 
+   int low = 1, high = 10; 
+   printMissing(arr, n, low, high); 
+   return 0; 
+}