human
Find prime numbers in the first half and second half of an array | Function to check if a number is prime or not.
Function to find whether elements are prime or not.
Traverse in the given range.
Check if a number is prime or not.
Function to print the prime numbers in the first half and second half of an array.
Driver Code.
Function call"
How can the above be solved in Python?
 ... Give me a code to find prime numbers in the first half and second half of an array and the other steps required?
assistant
#Here is code to find prime numbers in the first half and second half of an array and the other steps required.
 def prime ( n ) :
	for i in range ( 2 , n ) :
		if i * i > n :
			break
		if ( n % i == 0 ) :
			return False ;
	return True
def prime_range ( start , end , a ) :
	for i in range ( start , end ) :
		if ( prime ( a [ i ] ) ) :
			print ( a [ i ] , end = " ▁ " )
def Print ( arr , n ) :
	print ( " Prime ▁ numbers ▁ in ▁ the " , " first ▁ half ▁ are ▁ " , end = " " )
	prime_range ( 0 , n // 2 , arr )
	print ( )
	print ( " Prime ▁ numbers ▁ in ▁ the " , " second ▁ half ▁ are ▁ " , end = " " )
	prime_range ( n // 2 , n , arr )
	print ( )
arr = [ 2 , 5 , 10 , 15 , 17 , 21 , 23 ]
n = len ( arr )
Print ( arr , n )