For an array A, return the min number of swaps such that the array consists of all even elements of A, followed by all odd elements of A

Question

I\'ve come up with a solution for this question above, but I wanted to see if there were any better algorithms that can be used to accomplish the same task more efficiently