Data Structures and Algorithms is designed to as computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is coded, students can decide if a solution will be feasible or not.
- Teacher: Ganesh Prabhu Panchanathan