Test students' ability to implement and compare linear search, binary search, selection sort, and insertion sort on small arrays (≤10 elements). Require code or clear pseudocode for each algorithm, step-by-step traces on provided sample arrays (unsorted, sorted, and with duplicates), counts of comparisons and swaps, verification of correctness, and a brief written comparison addressing time/space behavior, stability, and when each method is most appropriate.