NCEA Level 3 Digital Technologies Practice Questions - NCEA Level 3 Digital Technologies (NZQA Achievement Standards) Exam

The runtime upper bound is expressed as a polynomial function of the input size, such as O(n^k). The algorithm runtime grows exponentially relative to the input size, such as O(2^n). The algorithm takes a constant amount of time regardless of input size. The algorithm can only run on parallel processing hardware.