Test students' ability to analyze and compare time (best/average/worst-case) and space complexity of common sorting and searching algorithms — bubble, insertion, merge, quick, heap, and binary search. Scope includes Big O/Θ/Ω notation, behavior on different input distributions (random, nearly-sorted, reverse-sorted), stability and in-place considerations, recursive vs iterative trade-offs, and selecting the most appropriate algorithm for constraints such as input size, memory limits, and stability requirements; tasks require short complexity calculations and justified algorithm choices.