CS Unplugged: Field guide: Complexity and tractability
An online resource for teaching Computer Science to students, this chapter focusses on complexity and tractability. This chapter covers problems where it's easy to tell the computer what to do --- by writing a program --- but the computer can’t do what we want because it takes far too long. Find out about what is meant by tractable and an intractable problem. Learn about complexity, why its an important concept and how it relates to algorithms.
|Year band(s)||5-6, 7-8, 9-10|
|Core and overarching concepts||Algorithms|
|Keywords||Tractable, Intractable, Algorithms, Sorting, Searching, Complexity|
University of Canterbury, New Zealand
University of Canterbury, New Zealand. Creative Commons BY-NC-SA 4.0.