
Sorting Algorithms
Computers
6th - 8th Grade
Used 22+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which of these statements best describes the process of sorting
Finding a particular item in a list of data
Organising data into files
Putting data items into a specific order
To help decide what items should go in the recycle bin
2.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
What does the term 'adjacent' mean?
Items of data that are next to each other
Items of data that opposite each other
Items of data that are the same
Items of data that are at the beginning of a list
3.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which statement best describes Bubble sort
is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
a set of instructions for solving a problem or accomplishing a task.
a method for reorganizing a large number of items into a specific order
An algorithm that separates a list of data into different data collections. Each data collection is sorted and then gathered back into a list
4.
MULTIPLE SELECT QUESTION
45 sec • 5 pts
Which statement best describes the term 'ascending'...
From highest to lowest
From lowest to highest
Random order
From Z-A
From A-Z
5.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
What would be in the last position after the first pass of a bubble sort if we were to sort in descending order
Henderson
Pickford
Kane
Foden
Saka
6.
MULTIPLE SELECT QUESTION
45 sec • 5 pts
We have learned about Bubble and Bucket sort today but can you name one other sorting algorithms
Organise Sort
Insertion Sort
Merge Sort
Sorting Sort
7.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which statement best describes a Bucket Sort...
Selecting items out of a bucket randomly and then using the order in which they came out
Splits the data set into two halves and then sorts each half
An algorithm that separates a list of data into different data collections. Each data collection is sorted and then gathered back into a list
is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?