Hi! I just had a discussion with a friend over Quicksort algorithm and we were confused as to which sort type quicksort is. In the lecture Gozz mentioned it was Distribution sort however when searching online it mentions it is comparison sort. The part I'm confused about is in the slides it is stated that distribution sort "Distribute the elements o the list into multiple intermediate data structures (blocks) such that there are no inversion between blocks", which is what Quicksort does but doesn't quicksort first use comparisons to get the 2 "blocks" (i.e. less than pivot or more than pivot). Could a sorting algorithm be both comparison-based and distribution-based? Could someone clarify which one it is and why it is that type? Thank you very much for reading and helping!