Write a python code to implement quick sort
Sure, here's an example implementation of quick sort in Python:

``` 
def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    else:
        pivot = arr[0]
        left = []
        right = []
        for i in range(1, len(arr)):
            if arr[i] < pivot:
                left.append(arr[i])
            else:
                right.append(arr[i])
        return quick_sort(left) + [pivot] + quick_sort(right)
``` 
This implementation uses the first element of the array as the pivot, and then partitions the array into two sub-arrays based on whether their elements are less than or greater than the pivot. It then recursively applies the same process to each sub-array and concatenates the results.

To use this implementation, you can simply call the quick_sort() function and pass in the array you want to sort as an argument, like this:
``` 
arr = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
sorted_arr = quick_sort(arr)
print(sorted_arr)  # Output: [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
``` 
I hope this helps!