Assess students' ability to trace and compare bubble sort, selection sort, and insertion sort on small integer lists (4–6 elements). Require step-by-step passes for each algorithm on given lists, counts of comparisons and swaps, identification of stability and best/worst-case behavior for those inputs, and a brief justified recommendation of which algorithm is most efficient for nearly-sorted versus reverse-sorted lists.