
Y11 Sort algorithms (Ch)
Authored by Gyorgy Denes
Computers
11th Grade
Used 2+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which sorting algorithm is this:
You repeatedly split the list and then rejoin them into pairs, fours, eights, etc. ?
insertion sort
merge sort
bubble sort
binary search
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which sorting algorithm is this:
You compare neighbouring elements repeatedly in each pass. You repeat passes until the list is fully sorted.
insertion sort
merge sort
bubble sort
binary search
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which sorting algorithm is this:
You maintain an unsorted an sorted parts in your list. In each pass, you find the place for the first unsorted item in the sorted list and put it there.
insertion sort
merge sort
bubble sort
binary search
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
You are using insertion sort.
Your list of numbers is currently [1, 3, 9, 11 | 5, 2, 12], where the "|" symbol indicates the boundary between the unsorted and sorted parts. What will be the contents of the list after the next pass is complete?
[1, 3, 9, 11, 5 | 2, 12]
[1, 3, 9, 5, 11 | 2, 12]
[1, 3, 5, 9, 11 | 2, 12]
[1, 2, 3, 5, 9, 11, 12]
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
You are using insertion sort.
Your list of numbers is currently [1, 3, 5, 9, 11 | 2, 12], where the "|" symbol indicates the boundary between the unsorted and sorted parts. What will be the contents of the list after the next pass is complete?
[2, 1, 3, 5, 9, 11 | 12]
[1, 3, 5, 9, 11, 2 | 12]
[1, 3, 5, 9, 11, 2, 12]
[1, 2, 3, 5, 9, 11 | 12]
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
You are using insertion sort.
Your list of numbers is currently [1, 2, 3, 5, 9, 11 | 12], where the "|" symbol indicates the boundary between the unsorted and sorted parts. What will be the contents of the list after the next pass is complete?
[2, 1, 3, 5, 9, 11, 12]
[1, 2, 3, 5, 9, 11, 12]
[1, 2, 3, 5, 9, 12, 11]
[1, 2, 3, 5, 9, 11 | 12]
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which sorting algorithm tends to be most (time) efficient?
merge sort
insertion sort
bubble sort
bogo sort
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?
Similar Resources on Wayground
16 questions
OCR Sys Arch J277
Quiz
•
10th - 12th Grade
10 questions
Matrizes
Quiz
•
11th Grade
15 questions
Computer Systems
Quiz
•
9th - 12th Grade
14 questions
AQA GCSE Databases and SQL
Quiz
•
9th - 12th Grade
10 questions
GPS---Where You At???
Quiz
•
4th - 12th Grade
20 questions
TEKNOLOGI JARINGAN BERBASIS LUAS (TJBL) - XI TKJ A
Quiz
•
11th Grade
20 questions
การผลิตสื่อสิ่งพิมพ์
Quiz
•
9th - 12th Grade
17 questions
Binary Representation
Quiz
•
9th - 11th Grade
Popular Resources on Wayground
15 questions
Fractions on a Number Line
Quiz
•
3rd Grade
20 questions
Equivalent Fractions
Quiz
•
3rd Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
54 questions
Analyzing Line Graphs & Tables
Quiz
•
4th Grade
22 questions
fractions
Quiz
•
3rd Grade
20 questions
Main Idea and Details
Quiz
•
5th Grade
20 questions
Context Clues
Quiz
•
6th Grade
15 questions
Equivalent Fractions
Quiz
•
4th Grade