Question

21. Custom-Sorted Array
In an a y, elements at any two indices an
be swapped in a single operation called a
move. For example, if the array is arr = [17,
4, 8], swap arr[0] = 17 and arr[2] = 8 to get
arr' = [8, 4, 17] in a single move. Determine
the minimum number of moves required to
sort an array such that all of the even
elements are at the beginning of the array
and all of the odd elements are at the end of
the array​

Answer 1

Answer:

elements at any two indices an

be swapped in a single operation called a

move. For example, if the array is arr = [17,

4, 8], swap arr[0] = 17 and arr[2] = 8 to get

arr' = [8, 4, 17] in a single move. Determine

the minimum number of moves required to

sort an array such that all of the even

elements are at the beginning of the array

and all of the odd elements are at the end of

the array