What term is used to describe an O(n) algorithm

Related MCQs

• An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of
• The complexity of the average case of an algorithm is
• The Average case occur in linear search algorithm
• The space factor when determining the efficiency of algorithm is measured by
• The time factor when determining the efficiency of algorithm is measured by
• Two main measures for the efficiency of an algorithm are
• The ______ sort algorithm is called diminishing increment sort.
• Which sorting algorithm can exploit the partially sorted data in a list?
• A sorting algorithm is stable if
• The complexity of Bubble sort algorithm is