Time and Space Complexity Analysis:Pair sum in array

public class PairSum{	
public static void pairSum(int[] arr, int num){
   
for(int i=0;i<arr.length;i++)
{ 
    for(int j=i+1;j<arr.length;j++)
    {
     
      
        if(arr[i]+arr[j]==num)
        {
            if(arr[i]<arr[j])
            System.out.println(arr[i]+" "+arr[j]);
             
            else
               System.out.println(arr[j]+" "+arr[i]); 
        }
    }
}
	
    
    
    
    
    }
}