Skip to content

Update Time and Space Complexity Analysis:Print Array intersection #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update Time and Space Complexity Analysis:Print Array intersection #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 7 additions & 4 deletions Time and Space Complexity Analysis:Print Array intersection
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
import java.util.*;
public class Intersection{
public static void intersection(int[] arr1, int[] arr2){
public class Solution {

public static void intersection(int[] arr1, int[] arr2){
Arrays.sort(arr1);
Arrays.sort(arr2);
merge(arr1,arr2);
Expand All @@ -11,7 +12,7 @@ public class Intersection{

while(i<arr1.length && j<arr2.length){
if(arr1[i] == arr2[j]){
System.out.println(arr1[i]);
System.out.print(arr1[i]+" ");
i++;
j++;
}else if(arr1[i] < arr2[j]){
Expand All @@ -21,4 +22,6 @@ public class Intersection{
}
}

}}
}

}