Quicksort 1 - Partition HackerRank

```python3

# https://www.hackerrank.com/challenges/quicksort1/problem
def quickSort(arr):
    p=arr[0]
    left=[]
    right=[]
    equal=[]
    for i in range(1,n):
        if arr[i]>p:
            right.append(arr[i])
        elif arr[i]<p:
            left.append(arr[i]) 
        elif arr[i]==p:
            equal.append(arr[i])    
        else:
            equal.append(arr[i])   
    left.append(p)        
    soln=left+equal+right
    return soln    


```