Given a string representing an array/vector/linked-list (your choice, will use array for clarity moving forward) of integers both positive and negative, output all the negative values on the left-hand side of the array and all positive numbers on the right-hand side of the array while maintaining their relative positions. You must do this in linear time and linear space complexity or better

please do what is says 

1. Given a string representing an array/vector/linked-list (your choice, will use array for clarity moving forward) of integers both positive and negative, output all the negative values on the left-hand side of the array and all positive numbers on the right-hand side of the array while maintaining their relative positions. You must do this in linear time and linear space complexity or better, i.e. you cannot scan the entire list multiple times again and again to place the values in an new array. You MUST utilize methods related to QuickSort to receive credit for this problem. We will NOT accept iterative solutions. NOTE: Do NOT sort the array, the elements need to remain in their original relative order. Hint: take a look at the partition function in QuickSort.

            Case 1:            Input 3: 1 -1 2 -2 3 -3 4 -4 5 -5           Output 3: -1 -2-3-4 -5 1 2 3 4 5

            Case 2:            Input 2: 14 9 -12 -13 -11 4 -4 3 3 9    Output 2: -12 -13 -11 -4 14 9 4 3 3 9

            Case 3:            Input 1: 3 -2 7 8 -7 -10 12 11             Output 1: -2 -7 -10 3 7 8 12 11