Given an array a of non-negative integers, return an array consisting of all the even elements of a, followed by all the odd elements of a.
example 1: input: [3,1,2,4] output: [2,4,3,1]
this is the code there is to start:
def sortarraybyparity(a):
a = [3,1,2,4]
print(sortarraybyparity(a))
how do i iterate over the numbers to test if they are even or odd?

def sortArrayByParity(A):

   array_length=len(A)

   s=0

   for i in range(0,array_length): #loop to iterate over the array

       if A[i]%2 ==0:  #if the number is even swap it with number at position s..

           t=A[s]

           A[s]=A[i]

           A[i]=t

           s=s+1 #increasing the count...

   return A

A=list(map(int,input("Enter array elements : \n").strip().split()))#taking input of the array.

print(sortArrayByParity(A))#printing the array.

Explanation:

My approach to do this question is to iterate over the array and take a pointer which points to the first index that is 0.If we encounter an even number swap it with first position element and increase the pointer and at last return the array.

hmu if ur willing to do a algebra a online class i’ll pay 600 hmu on the gram profitpreme

you, i'm trying to get a higher rank, this really ! : )