human
Time Complexity and Space Complexity | Function to find a pair in the given array whose sum is equal to z.
Iterate through all the pairs.
Check if the sum of the pair ( a [ i ] , a [ j ] ) is equal to z.
Given Input.
Function Call"
Solution in Python:

Write me a code to time Complexity and Space Complexity and the other steps required?
assistant
#Here is code to time Complexity and Space Complexity and the other steps required.
 def findPair ( a , n , z ) :
	for i in range ( n ) :
		for j in range ( n ) :
			if ( i != j and a [ i ] + a [ j ] == z ) :
				return True
	return False
a = [ 1 , - 2 , 1 , 0 , 5 ]
z = 0
n = len ( a )
if ( findPair ( a , n , z ) ) :
	print ( " True " )
else :
	print ( " False " )