Year 8: Homework 7: Sorting and Searching Algorithms Quiz

Which algorithm would be more efficient for finding an item in a sorted list: linear search or binary search?

• Linear search

• Binary search

Which sorting algorithm divides the list into smaller sublists, sorts those sublists, and then merges them back together?

• Insertion sort

• Bubble sort

• Merge sort

• Selection sort

Which sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order?

• Bubble sort

• Merge sort

• Quick sort

• Insertion sort

Which searching algorithm checks each element in a list one by one until a match is found?

• Binary search

• Bubble search

• Linear search

• Quick search

Which of the following is a basic searching algorithm that checks each element in a list one by one until a match is found?

• Binary search

• Bubble search

• Linear search

• Quick search

What is the main goal of sorting algorithms?

• To rearrange data into a random order

• To arrange data in a specific order, such as numerical or alphabetical

• To delete unwanted data

• To find a specific element in a list

What is the primary purpose of computational thinking in problem-solving?

• To find the quickest solution

• To apply algorithms and logic to solve problems

• To create complex software programs

• To write essays about technology

Which sorting algorithm works by repeatedly moving elements one position ahead until they are in the correct order?

• Bubble sort

• Merge sort

• Insertion sort

• Selection sort