Abstract: Every algorithm has its own best-case as well as its worst-case scenario, so it is difficult to determine the best sorting algorithm just by its Big-O. Not only that, the amount of memory ...

Given an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even, i is even.