What is the time complexity of linear search in the worst case?

O(n)

Fill in the blank: Linear search is also known as ______.

Sequential search

True or False: Binary search can be performed on an unsorted array.

False. Binary search requires the array to be sorted.

What is the average case time complexity of binary search?

O(log n)

Riddle: I split an array into halves and conquer, using a pivot to sort every number. What am I?

Quick Sort

What is the primary advantage of using binary search over linear search?

Binary search has a time complexity of O(log n), making it faster for large datasets compared to O(n) for linear search.

In the context of sorting algorithms, what does the term 'stable' refer to?

A stable sorting algorithm maintains the relative order of records with equal keys.

Fill in the blank: The time complexity of merge sort is ______ in all cases.

O(n log n)

True or False: Merge sort is an in-place sorting algorithm.

False. Merge sort requires additional space for the temporary array.

What is the main principle behind the quick sort algorithm?

Divide and conquer

Riddle: I can sort numbers, but I need a good pivot to avoid a mess. What am I?

Quick Sort

What is the space complexity of the iterative implementation of binary search?

O(1)

Fill in the blank: The average case time complexity of selection sort is ______.

O(n²)

What is the auxiliary space complexity of bubble sort?

O(1)

True or False: Counting sort can sort negative numbers directly without modifications.

False. Counting sort needs modifications to handle negative numbers.

What is the major drawback of using bubble sort?

It has a time complexity of O(n²) making it inefficient for large datasets.

Riddle: I take many passes but can be efficient if almost sorted. What am I?

Insertion Sort

What is the time complexity of heap sort?

O(n log n)

Fill in the blank: A ______ is a complete binary tree where each node's value is greater than or equal to its children.

Max heap

True or False: Radix sort is a comparison-based sorting algorithm.

False. Radix sort is not comparison-based.

What is the main advantage of radix sort over comparison-based algorithms?

It can sort numbers in linear time O(n) under certain conditions.

Riddle: I sort but require a stable base to do my work, shifting digits from least to most. What am I?

Radix Sort

What is the primary function of the merge() in merge sort?

To combine two sorted halves into a single sorted array.

What is the time complexity of linear search in the worst case?

O(n)