What is the worst-case time complexity of the linear search algorithm?
O(n log n)
O(log n)
O(n)
O(1)
Which time complexity is characterized by an algorithm's runtime doubling with each additional input element?
O(2^n)
O(n!)
O(n^2)
What does an algorithm with a time complexity of O(n) signify?
The runtime is constant regardless of input size
The runtime increases exponentially with the input size
The runtime increases linearly with the input size
The runtime is unpredictable
What is the time complexity of searching for an element in a sorted array using binary search?
What is the primary focus of Big-O notation in time complexity analysis?
Describing the upper bound of an algorithm's growth rate
Representing the lower bound of an algorithm's growth rate
Expressing the exact number of operations an algorithm performs
Calculating the average-case runtime of an algorithm
What is the time complexity of the QuickSort algorithm in the worst-case scenario?
Which notation represents a strict upper bound, meaning the function grows strictly slower than the specified function?
Little-omega (ω)
Big-O (O)
Little-o (o)
Big Theta (Θ)
Which sorting algorithm has a time complexity of O(n^2) in its average and worst case?
Heap Sort
Bubble Sort
Merge Sort
Quick Sort
Merge sort and heapsort are examples of sorting algorithms with which time complexity?
You have two algorithms for a task: Algorithm A has a time complexity of O(n log n), and Algorithm B has O(n^2). For which input size 'n' would Algorithm A likely start to outperform Algorithm B?
n = 1000
n = 10
n = 100
It depends on the specific algorithms and their constant factors.