WorksheetsAlgorithm Y8
Total questions: 12
Worksheet time: 6mins
Which is more efficient for large sets of data?
Which is more efficient for large sets of data?
Which sorting algorithm divides the list into smaller sublists before sorting?
Bubble sort
Merge sort
Which search algorithm checks every element one by one?
Linear search
Binary search
Which sorting algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order?
Bubble sort
Merge sort
Which search algorithm requires the data to be sorted before it can be used?
Binary search
Linear search
Which sorting algorithm is generally faster for large, unsorted lists?
Bubble sort
Merge sort
When does a linear search stop?
When it finds what it is looking for
It does not stop
When everything is in order
When it gets to the end of the list
