Practice

What algorithm starts by dividing the search interval in half?

Linear Search Binary Search Bubble Sort None of the Options

What algorithm swaps adjacent elements if the are in the wrong order?

Merge Sort Binary Search Insertion Sort Bubble Sort

What is the main disadvantage of linear search compared to binary search?

It finds the element faster. It is slower with large datasets. It requires sorting. It uses more memory.

What is the worst case time complexity of merge sort?

O(n log n) O(n) O(n²) O(log n)

What describes "time complexity" the best?

The speed of the CPU. The length of the code. The time taken based on the input size. A physical device used to test the speed of an algorithm.

What is the main idea behind "divide and conquer"?

An algorithm to search for an element in a list. Checking each element one by one. Using multiple sorting algorithms at the same time to sort data faster. Breaking a problem into smaller parts and solving them.

What scenario would best justify using bubble sort?

Sorting a large data set efficiently. Sorting a small list simply. Searching a large sorted list efficiently. A large list used in real time systems.

What is an algorithm?

A pattern used to display data. Random operations that are performed by a computer. A set of instructions used to solve a problem. A programming language.

What is the main reason for sorting data before searching?

To make searching faster. To remove all duplicates in the dataset. To reduce memory usage. To reduce the amount of storage the dataset takes.

What would be the best algorithm to use if you wanted to find a word in a dictionary quickly?

Bubble Sort Linear Search Merge Sort Binary Search