How to implement a quicksort with this given partition function that takes a pivot and a list as arguments and returns a

[answerhappygod]

How to implement a quicksort with this given partition function
that takes a pivot and a list as arguments and returns a list of
two lists, a lower than pivot list and a greater than pivot
list.
I want the code for quicksort function that uses this partition
in Scheme programming language.
This given partition works like: