Test students' ability to analyze and compare bubble, insertion, merge, quick, and heap sorts by evaluating time complexity (best/average/worst), space usage (in-place vs extra memory), stability, adaptivity to nearly-sorted or small inputs, and input suitability (random, reversed, few unique keys, linked lists, external data). Expect tasks that require selecting the most appropriate algorithm for specific constraints, explaining trade-offs and constant-factor considerations, and justifying choices with complexity reasoning.