cs alevel question quick sort

helloo

just wondering for the Alevel OCR spec, what would be the best way to learn the quick sort algorithm cause the websites online r confusing me so much i’ve been stuck on it for so long and the mark scheme for one of the OCR questions

Attachment not found

i understand the first method but i’m just thinking about if they were to ask another quick sort algorithm question (but with marks for actually applying it to the data set)
id only have 2 marking points being
the smaller than pivot list and larger then pivot list.

and the second methods throwing me off cause i
also i have a third method i think?? i cant tell if it’s the same as the second method 😭you set a pivot and compare each 2 Low mark pointer and High Mark pointer to the pivot, - when an overlap occurs you swap the pivot with the overlap

sorry for the long post i didn’t know how to word it better but any help at all would be very much appreciated