Pearson GCSE Computer Science - 1.2.6 Standard Algorithms

What is the purpose of the bubble sort algorithm?

• a) To search for an item in a list
• b) To sort a list in ascending order
• c) To sort a list in descending order
• d) To insert an item into a list

Answer explanation

The purpose of the bubble sort algorithm is to sort a list in ascending order.

How does the bubble sort algorithm work?

• a) It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
• b) It divides the list into smaller sublists, sorts each sublist, and then merges them
• c) It searches for a target value by checking each element in the list one by one
• d) It locates the middle element of the list and compares it with the target value

Answer explanation

The bubble sort algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

What is the purpose of the merge sort algorithm?

• a) To search for an item in a list
• b) To sort a list in ascending order
• c) To sort a list in descending order
• d) To insert an item into a list

Answer explanation

The purpose of the merge sort algorithm is to sort a list in ascending order.

How does the merge sort algorithm work?

• a) It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
• b) It divides the list into smaller sublists, sorts each sublist, and then merges them
• c) It searches for a target value by checking each element in the list one by one
• d) It locates the middle element of the list and compares it with the target value

Answer explanation

The merge sort algorithm divides the list into smaller sublists, sorts each sublist, and then merges them.

What is the purpose of the linear search algorithm?

• a) To search for an item in a list
• b) To sort a list in ascending order
• c) To sort a list in descending order
• d) To insert an item into a list

Answer explanation

The purpose of the linear search algorithm is to search for an item in a list.

How does the linear search algorithm work?

• a) It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
• b) It divides the list into smaller sublists, sorts each sublist, and then merges them
• c) It searches for a target value by checking each element in the list one by one
• d) It locates the middle element of the list and compares it with the target value

Answer explanation

The linear search algorithm searches for a target value by checking each element in the list one by one.

What is the purpose of the binary search algorithm?

• a) To search for an item in a list
• b) To sort a list in ascending order
• c) To sort a list in descending order
• d) To insert an item into a list

Answer explanation

The purpose of the binary search algorithm is to search for an item in a list.

How does the binary search algorithm work?

• a) It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
• b) It divides the list into smaller sublists, sorts each sublist, and then merges them
• c) It searches for a target value by checking each element in the list one by one
• d) It locates the middle element of the list and compares it with the target value

Answer explanation

The binary search algorithm locates the middle element of the list and compares it with the target value.

What is the purpose of the bubble sort algorithm?

• a) To search for an item in a list
• b) To sort a list in ascending order
• c) To sort a list in descending order
• d) To insert an item into a list

Answer explanation

The purpose of the bubble sort algorithm is to sort a list in ascending order.

How does the bubble sort algorithm work?

• a) It repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
• b) It divides the list into smaller sublists, sorts each sublist, and then merges them
• c) It searches for a target value by checking each element in the list one by one
• d) It locates the middle element of the list and compares it with the target value

Answer explanation

The bubble sort algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.