This term and "logarithmic" form a portmanteau that describes the time complexity of the Quicksort algorithm.
This term and "logarithmic" form a portmanteau that describes the time complexity of the Quicksort algorithm. The time for finding an item in an unsorted list grows as this type of function of the number of items in the list, giving its time complexity this property. Functions of this type, which have no derivatives above order one and constant first derivative, can be expressed in the point-slope and slope-intercept forms. For 10 points, name this type of mathematical function with constant slope.
This term and "logarithmic" form a portmanteau that describes the time complexity of the Quicksort algorithm.
linear [accept words forms like linearity or line; prompt on n]