Home › AP Computer Science A › Computer Science › Data Structures and Algorithms › One order of growth turns up constantly in algor…
One order of growth turns up constantly in algorithm analysis and is written O(log N). It is called:
AExponential
BFactorial
CQuadratic
DLogarithmic
Answer & Solution
Correct answer: D. Logarithmic
1. The list is halved again and again.
2. The name comes from the logarithm.
3. It is logarithmic.
_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Related questions
A well-known algorithm that showcases design principles useful across many problems is calA tree that uses ordering properties of the data to keep elements in a searchable hierarchIn a heap, the element that can always be reached most efficiently sits at the:A collection where every element carries an associated priority value is a:Instead of narrowing down a sorted list by comparisons, hashing can index an element direcA structure stores and retrieves elements in an array indexed by hash value. That structurMapping each object to an integer so that different objects get different integers is the Another sorting algorithm partitions data around a chosen element and recurses on each sid