A complexity class groups computational problems based on the resources—typically Time or Space—needed by an algorithm to solve them. These classes map the inherent difficulty of problems, revealing the boundaries of efficient computation. See also P vs NP Algorithm Computational Problem Turing Machine