New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

GCSE CS: Searching & Sorting Quiz

Quiz

Played 21 %Accuracy 40 Average time 01:59

About this activity

Test basics of search/sort (bubbles, merge, linear, binary)

Created by

United Kingdom

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
GCSE CS: Searching & Sorting Quiz
 

GCSE CS: Searching & Sorting QuizOnline version

Test basics of search/sort (bubbles, merge, linear, binary)

by James Cooper
1

Which algorithm is used to sort by repeatedly swapping adjacent items until the list is sorted?

2

Which algorithm splits the list into halves to sort or search?

3

Which search method is fastest on a sorted list with random access?

4

Which algorithm repeatedly checks the middle element to locate a target in a sorted array?

5

Which data operation sorts by combining two sorted halves into a single sorted list?

6

Which search is most efficient for an unsorted list of unknown order?

7

Which sorting algorithm has the best performance on a nearly sorted array?

8

Which algorithm would you choose to search a sorted array with frequent searches?

Feedback

Bubble sort swaps adjacent items to bubble up the largest to the end.

Merge sort divides and conquers by merging sorted halves.

Binary search halves the search interval each step on a sorted list.

Binary search compares with the middle and halves the range.

Merge sort recursively sorts halves and merges them.

Linear search checks each item until found; no order assumed.

In practice, bubble sort can perform well on nearly sorted data.

Binary search benefits from the sorted order for fast lookups.

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.