Discrete Mathematics – Quick Sorting Question

Can someone help me with this sorting question? I am new to the sorting algorithm and just try to complete the same process.

Questions: Sort the following items using the Quick Sort algorithm

15, 10, 13, 9, 12, 7.

I started to solve that and tried a lot.

Selected the last element as a fulcrum and continuously checked the comparison with the fulcrum.

If in step 4 (i) the first element and (j) the first element of the array which is 15, this is swapped with the pivot value 7.

After that, I was just confused how to proceed.

Thanks for your help.