human
Find relative complement of two sorted arrays | Python program to find all those elements of arr1 [ ] that are not present in arr2 [ ].
If current element in arr2 [ ] is greater , then arr1 [ i ] can 't be  present in arr2[j..m-1].
Skipping smaller elements of arr2 [ ].
Equal elements found ( skipping in both arrays ).
Printing remaining elements of arr1 [ ].
Driver code"
Solution in Python:
assistant
#Here is code to find relative complement of two sorted arrays and the other steps required.
 def relativeComplement ( arr1 , arr2 , n , m ) :
	i = 0
	j = 0
	while ( i < n and j < m ) :
		if ( arr1 [ i ] < arr2 [ j ] ) :
			print ( arr1 [ i ] , " ▁ " , end = " " )
			i += 1
		elif ( arr1 [ i ] > arr2 [ j ] ) :
			j += 1
		elif ( arr1 [ i ] == arr2 [ j ] ) :
			i += 1
			j += 1
	while ( i < n ) :
		print ( arr1 [ i ] , " ▁ " , end = " " )
arr1 = [ 3 , 6 , 10 , 12 , 15 ]
arr2 = [ 1 , 3 , 5 , 10 , 16 ]
n = len ( arr1 )
m = len ( arr2 )
relativeComplement ( arr1 , arr2 , n , m )