Algorithms Chapter 2.1: Linear and Binary Search

Play an AI-generated podcast conversation about this lesson

What is the primary difference between Linear Search and Binary Search?

The number of items in the list
The method of dividing the list (correct)
The speed of the algorithm
The order in which the list is searched

What happens when the item is found in a Linear Search?

The algorithm moves to the next item in the list
The algorithm stops and returns the item (correct)
The algorithm repeats the previous step
The algorithm continues to the end of the list

What is the primary goal of the first pass in the sorting algorithm?

To sort the entire list
To divide the list into sub-lists
To compare each item with all the others
To place the largest item at the end of the list (correct)

What is the purpose of finding the middle item in Binary Search?

To divide the list into two halves (D) Signup and view all the answers

How do you split the list in the Merge Sort algorithm?

In half, forming two sub-lists (B) Signup and view all the answers

What happens to the list in Binary Search after the first comparison?

The list is divided into two halves (C) Signup and view all the answers

What is the purpose of step 2 in the Insertion Sort algorithm?

To compare the item with all items before and insert it in the correct place (D) Signup and view all the answers

What is true about the Merge Sort algorithm?

It uses less memory than Insertion Sort (C) Signup and view all the answers

What is the advantage of Binary Search over Linear Search?

Binary Search is faster for large lists (C) Signup and view all the answers

What happens in step 3 of the Merge Sort algorithm?

The sub-lists are merged together in order (D) Signup and view all the answers

What is a necessary step before performing Binary Search?

Sorting the list (C) Signup and view all the answers

What is the main difference between Insertion Sort and Merge Sort?

Insertion Sort uses more memory than Merge Sort (D) Signup and view all the answers

What is the main difference between a linear search and a binary search?

A binary search requires a sorted list. (C) Signup and view all the answers

What is the primary goal of the Bubble Sort algorithm?

To sort the list in ascending order. (C) Signup and view all the answers

How many passes are required to sort a list of n items using the Bubble Sort algorithm?

n – 1 passes. (D) Signup and view all the answers

What is the main characteristic of the Merge Sort algorithm?

It is an example of a divide and conquer algorithm. (A) Signup and view all the answers

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

It is faster with large lists. (A) Signup and view all the answers

What is the main disadvantage of the Bubble Sort algorithm?

It is not efficient on large lists. (A) Signup and view all the answers

What is the primary advantage of the Bubble sort algorithm?

It is efficient to check if a list is already in order. (A) Signup and view all the answers

What is the purpose of a Constant in a program?

To store a value that will not change in the program. (D) Signup and view all the answers

What is the main characteristic of a Real data type?

It is a number with a decimal fraction. (C) Signup and view all the answers

What is the purpose of Iteration in a program?

To repeat a set of instructions until a condition is met. (A) Signup and view all the answers

What is the type of memory location where a value can be used and changed during the program?

Variable (B) Signup and view all the answers

Which sorting algorithm is the fastest on large lists?

Merge sort (A) Signup and view all the answers