Answers are grounded in this paper and cite their sources.
The article proposes a methodology for teaching the quicksort algorithm for arrays (lists) in the course “Fundamentals of the Python Programming Language”. Quicksort combines three ideas that are difficult for novices – recursion, the divide-and-conquer strategy and in-place partitioning – so the methodology introduces them gradually. It is based on the PRIMM approach (Predict – Run – Investigate – Modify – Make) and consists of five stages: modelling recursion by hand with number cards, completing a partition trace table and a recursion tree, coding in two steps (first a short list-based version, then an in-place version with Lomuto partitioning), visualising the call stack and testing automatically, and analysing the average and worst-case complexity of the algorithm experimentally. The article presents reference Python implementations, an execution trace, the results of a computational experiment on the number of comparisons, typical student errors, a comparison with other sorting methods and a plan for a pedagogical experiment.
No takes yet. Share an insight, caveat, or question.
Fathiddinov Saidma'ruf Lazizxo'ja o'g'li (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: