6 terms
Big O is the notation that describes an upper bound on how an algorithm's running time or memory use grows as the input size increases.
Binary search finds a value in a sorted collection by repeatedly halving the search interval, needing about log2(n) comparisons for n elements.
Linear search is the algorithm that checks each element of a collection in order until it finds the target or reaches the end, running in O(n)…
Quicksort is a divide-and-conquer sorting algorithm that partitions data around a pivot, averaging O(n log n) time and sorting in place with little memory.
A sorting algorithm arranges the elements of a collection into a defined order, trading off speed, memory use and stability in different ways.
Time complexity describes how the running time of an algorithm grows with the size of its input, usually expressed in Big O notation such as O(n…