Merge pull request #268 from Ishaan-10/master

array Intersection program

Contributors.html

@@ -160,6 +160,7 @@ <h1 class="animated rubberBand delay-4s">Contributors</h1>
         <a class="box-item" href="https://github.com/evergreen2001"><span>Ido Evergreen</span></a>
         <a class="box-item" href="https://github.com/Zaheudev"><span>Zaharia Iulian</span></a>
         <a class="box-item" href="https://github.com/haryanapnx"><span>Haryfun</span></a>
+        <a class="box-item" href="https://github.com/ishaan-1n"><span>Ishaan</span></a>
         <a class="box-item" href="https://github.com/Alok-873"><span>Alok Tripathi</span></a>
         <a class="box-item" href="https://github.com/qdtroemner"><span>Quentin Troemner</span></a>
         <a class="box-item" href="https://github.com/satyampgt4"><span>Satyam</span></a>

Program's_Contributed_By_Contributors/Java_Programs/arrayIntersection.java

@@ -0,0 +1,51 @@
+public class arrayIntersection{
+
+    public static void intersect(int[] a,int[] b){
+
+        int minSize = (a.length>=b.length) ? b.length:a.length;
+        int c[] = new int[minSize];
+        int z=0;
+        for(int i=0;i<a.length;i++){
+
+            for(int j=0;j<b.length;j++){
+
+                if(a[i]==b[j]){
+
+                    if(search(c, a[i])==-1){
+                        c[z]=a[i];
+                        z++;
+                    }
+                }
+            }
+        }
+
+
+    }
+
+    public static int search(int arr[],int a){
+
+        int start=0,end=arr.length-1;
+
+        while(start<=end){
+
+            int mid=(start+end)/2;
+            if(arr[mid]>a){
+                end=mid-1;
+            }else if(arr[mid]<a){
+                start = mid+1;
+            }else{
+                return mid;
+            }
+
+        }
+
+        return -1;
+    }
+
+    public static void main(String[] args) {
+
+        int arr1[] = { 1,2,3,4,5,6,7,8,9,10};
+        int arr2[] = { 5,6,7,8,9,10,11,12,13,14,15,16};
+        intersect(arr1,arr2);
+    }
+}