Assess learners' ability to analyze and compare time and space complexities (best/average/worst), in-place vs. extra-memory requirements, and stability for bubble, insertion, merge, quick, heapsort, and radix sorts. Test understanding of practical trade-offs and input-dependent choices (e.g., nearly sorted data, large datasets, integer/radix constraints), and require justification of algorithm selection for given scenarios; include short tasks to compute complexities, state stability and memory usage, and recommend the most appropriate algorithm with reasons.