Question 1

Why is a merge sort algorithm better for larger data sets?

Accepted Answer

It requires less processing steps that a bubble sort

Answer

It is easier to program

Answer

It is a more simple algorithm

Answer

It does not need to compare any data items

Question 2

Which algorithm is better for small data sets, bubble or merge?

Accepted Answer

Both work well with small data sets

Answer

Merge sort

Answer

Bubble sort

Answer

Neither work well with small data sets

Question 3

Which sorting algorithm works better with mixed data types?

Accepted Answer

Neither work in mixed data types

Answer

Bubble sort

Answer

Merge sort

Answer

Both work as well as each other

Question 4

Which sorting algorithm requires the most memory and processing time?

Accepted Answer

Bubble sort

Answer

Merge sort

Answer

Linear Search

Answer

Binary Search

Question 5

What is one advantage of the bubble sort?

Accepted Answer

It is a simple algorithm to program compared to others

Answer

It requires less processing time

Answer

It can handle mixed data types

Answer

It is useful for large data sets

Question 6

What is one advantage of the merge sort?

Accepted Answer

It is useful for large data sets

Answer

It can handle mixed data types

Answer

It requires more processing time

Answer

It is a simple algorithm to program compared to others

Question 7

What is one disadvantage of the bubble sort?

Accepted Answer

It is  not useful for large data sets

Answer

It requires less processing time

Answer

It is a simple algorithm to program compared to others

Answer

It can handle mixed data types

Question 8

What is one disadvantage of the merge sort?

Accepted Answer

It is a more complex algorithm to program compared to others

Answer

It requires less processing time

Answer

It can handle mixed data types

Answer

It is useful for large data sets

Question 9

Which of these is not an advantage of the bubble sort?

Accepted Answer

It is more efficient on large data sets

Answer

It is a simple algorithm

Answer

It is easy to apply to real life sorting methods

Answer

It is efficient for small data sets

Question 10

Which of these is not an advantage of the merge sort?

Accepted Answer

It is a simple algorithm compared to the bubble sort

Answer

It requires less processing time

Answer

It is efficient for small data sets

Answer

It is more efficient on large data sets

Question 11

Which algorithm iterates through a data set repeatedly, swapping values that are in the wrong order?

Accepted Answer

Bubble sort

Answer

Linear Search

Answer

Binary Search

Answer

Merge Sort

Question 12

Which algorithm uses the divide and conqueror approach to sorting data sets?

Accepted Answer

Merge sort

Answer

Binary search

Answer

Bubble sort

Answer

Linear search

Related quizzes

Related quizzes