Given an array, sort the array in such a way that the first part of the sorted array contains odd numbers, and the second part contains even numbers. The first part has to be sorted in descending order and the second part in ascending order. Not extra array, no pre or post processing and it has to use a conventional sorting mechanism.

From here

--

Solution:

Iterate through the array and multiply all odd numbers by -1,Sort the array, again multiply the odd numbers by -1. O(n)+O(nlogn)+O(n)=O(nlogn)