Home › AP Computer Science A › Computer Science › Data Structures and Algorithms › A computer scientist describes how the running t…
A computer scientist describes how the running time of an algorithm grows with input size. The notation used is:
ABit map notation
BByte code notation
CBig O notation
DBar chart notation
Answer & Solution
Correct answer: C. Big O notation
1. Time complexity is the subject.
2. It captures the order of growth.
3. It is Big O notation.
_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