Given an array with random odd and even integers.

Please suggest the most efficient algorithm to put all even numbers on one side and all odd numbers on the other side in this array.

Source: Got an Email from an unknown person.

My algorithm looks at four members at a time and makes a single pass through the array. This will sort the array to have odd values before the even values.

Declare pointers A, B, Y, and Z. A starts at the first member, B at the second, Y at the second-to-last, and Z at the last.

If the member at A is odd and the member at Z is even, then increment pointers A and B and decrement pointers Y and Z.

If the member at A is odd and the member at Z is odd, then swap the members at B and Z and increment pointers A and B.

If the member at A is even and the member at Z is even, then swap the members at A and Y and decrement pointers Y and Z.

If the member at A is even and the member at Z is odd, then swap the members at A and Z and increment pointers A and B and decrement pointers Y and Z.

Repeat this until only two members remain. Those last two members are handled in a simple comparison with a swap if needed.