Assess students' ability to analyze and compare time and space complexity trade-offs among bubble sort, merge sort, and quicksort across sorted, reverse-sorted, random, and nearly-sorted inputs. Require stating best/average/worst-case time complexities, auxiliary space usage, stability and in-place properties for each algorithm; explaining how input order and pivot selection affect quicksort's performance; evaluating algorithm choice given constraints (memory limits, need for stability, nearly-sorted data, and constant factors); and interpreting brief empirical timing/memory results to justify recommendations.