Algorithm - Linear Time - O(n)

Sorting Quicksort Anim


A linear time O(n) is when the running time of an algorithm is a linear equation of its input n.

ie <MATH> \text{Running Time} = a * n + b </MATH> b is not significant as it has a low level impact on the running time.

Discover More
Sorting Quicksort Anim
Algorithm - (Performance|Running Time|Fast)

The performance of an algorithm can be assessed through the number of basic operations that it performs as a function of the length of the input numbers. running time = # of lines of code executed. ...
Card Puncher Data Processing
Data Processing - Selection

selection is a data processing operation. finding: the min, the max the median or even any kth element in sub-linear time

Share this page:
Follow us:
Task Runner