diff --git a/Time and Space Complexity Analysis:Print Array intersection b/Time and Space Complexity Analysis:Print Array intersection
index d09d416..d507c48 100644
--- a/Time and Space Complexity Analysis:Print Array intersection	
+++ b/Time and Space Complexity Analysis:Print Array intersection	
@@ -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);
@@ -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]){
@@ -21,4 +22,6 @@ public class Intersection{
             }
         }
         
-     }}
+     }
+
+}