Assess students' ability to analyze and compare the time and space trade-offs of bubble sort, insertion sort, merge sort, quicksort, and heapsort. Expect them to state best/average/worst-case time complexities and auxiliary space, identify stability and in‑place properties, explain performance on small, nearly-sorted or large datasets and memory‑constrained environments, and justify algorithm selection for specific scenarios.