Quick Sort

Divides array into two sets. Select an element to be the pivot.

Middle element, or random (for faster results)

Pivot splits array into two.

https://www.cse.ust.hk/~dekai/271/notes/L01a/quickSort.pdf

Merge Sort

So basically, you split the list into the smallest parts possible, and then start comparing two-by-two, and reassembling.

wikipedia link

Comb Sort

All about comb sort here!