algorithmic complexity

Show Summary Details

Quick Reference

The number of steps required in an algorithm depends on the process and on the number of items being operated on. An algorithm where the number of steps increases in direct proportion to the number of items is said to have linear complexity, so if there are three times as many items the algorithm will have three times as many steps. If the algorithm was of quadratic complexity then there would have been nine times as many steps.

Subjects: Mathematics.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.