An algorithm is said to take linear time, or O(n) time, if its time complexity is O(n). Informally, this means that for large enough input sizes the running time increases linearly with the size of the input. For example, a procedure that adds up all elements of a list requires time proportional to the length of the list. This description is slightly inaccurate, since the running time can significantly deviate from a precise proportionality, especially for small values of n.
Linear time is often viewed as a desirable attribute for an algorithm. Much research has been invested into creating algorithms exhibiting (nearly) linear time or better. This research includes both software and hardware methods. In the case of hardware, some algorithms which, mathematically speaking, can never achieve linear time with standard computation models are able to run in linear time. There are several hardware technologies which exploit parallelism to provide this. An example is content-addressable memory. This concept of linear time is used in string matching algorithms such as the Boyer-Moore Algorithm and Ukkonen's Algorithm.
Read more about this topic: Time Complexity
Famous quotes containing the word time:
“You say your own soul supplies you with some sort of an idea or image of God. But at the same time you acknowledge you have, properly speaking, no idea of your own soul. You even affirm that spirits are a sort of beings altogether different from ideas. Consequently that no idea can be like a spirit. We have therefore no idea of any spirit.”
—George Berkeley (1685–1753)