NEW
Font size
WorksheetsSearching & sorting algorithms
Total questions: 21
Worksheet time: 12mins
4 5 9 6 2 7
4 5 6 2 7 9
4 5 2 6 7 9
11, 8, 13, 9, 7, 3
How many searches will it take to find 10 in [1,3,5,7,10,12,15] using BINARY search?
3
4
5
6
Why do we use BUBBLE SORT?
To place items in ORDER
To SEARCH for values in a list
Which algorithm uses a divide and conquer approach?
Linear Search
Binary Search
What is an algorithm?
When a task or problem is broken down to make it easier to solve.
When unnecessary detail is removed from a problem to make it easier to solve.
When patterns are identified to make a problem easier to solve.
When a step-by-step set of instructions are developed to form a solution to a problem.
How does a merge sort work?
It sorts a list by comparing neighbouring items to see which is out of order
It takes one item from the list and places it in the correct place
It finds an item of data in a list
It divides the list into sublists and then merges pairs of sublists together to sort the data.
Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.
Merge
Bubble
Insertion
Binary
Which type of sort algorithm is this?
Bubble
Selection
Merge
Purge
