What happens if we use Divide and Conquer after sorting? Will that be efficient, sort it and try to remove all the -Ve elements by dividing the array and checking the last element, if it's null ignore it and continue till you get +ve element in left array's last element, then use index and figure out won't it reduce the time?