Yet another analysis of algorithms laboratory
Ed C. Epp · ACM SIGCSE Bulletin · 1992
Laboratory assignments can reinforce material given in lecture by making it come alive in practice. A prime example is the time complexity of algorithms. However, laboratories that confirm the time complexity of algorithms can be tedious exercises that do not really challenge a student to think about the algorithms they are testing. By giving students a set of unknown executables, the laboratory becomes more of a detective problem. Students are required to apply what they know about the sort algorithms so that they can identify them.