Please help me implement a quick sort function with a partition function in python with recursion

The quicksort function should take as input an array (numpy array), and for large enough arrays pick a pivot value, call your partition function based on that pivot value, and then recursively call quicksort on resulting partitions that are strictly smaller in size than the input array in order to sort the input. Additionally, your quicksort should transition from recursive calls to "manual" sorting (via if statements or equivalent) when the arrays become small enough. The partitionInPlace function should take as input an array (numpy array) and pivot value, partition the array (in at most linear amount of work and constant amount of space), and return an index such that (after returning) no further swaps need to occur between clements below and elements above the index in order for the array to be sorted