What would be the order of this list after 1 pass of a bubble sort? 5, 2, 18, 7, 6, 9

Bubble and Merge Sort

Quiz
•
Emma-Louise Brant
•
Computers
•
10th Grade
•
31 plays
•
Medium
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
2, 5, 6, 7, 9, 18
18, 9, 7, 6, 5, 2
2, 5, 7, 6, 9, 18
5, 2, 7, 6, 18, 9
2.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
What does a sorting algorithm do?
Finds an item of data in a set of data
Saves a set of data
Puts a list of items into order
Copies a list of items
3.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which of the following is not a sorting algorithm?
Bubble Sort
Insertion Sort
Merge Sort
Long Sort
4.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
How does a bubble 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.
5.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
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.
6.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
7.Why does a bubble sort do a final pass even when the data is in the correct order?
To put the data back into a list
To save the list
Because it doesn't recognise that the list is in order until it completes a final pass with no swaps
To double check in case of mistakes
7.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
8.Which of the following is an advantage of a bubble sort?
It takes a very long time to run
It's very quick
It's simple to implement
There is no advantage of using a bubble sort
8.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which of the following is an advantage of a merge sort?
It's simple to implement
It takes a long time to run
It's quick and efficient for sorting long lists
There is no advantage of using a merge sort
9.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.
Merge
Bubble
Insertion
Binary
10.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Which sorting algorithm is described by: moving through a list repeatedly, swapping elements that are in the wrong order.
Merge
Insertion
Binary
Bubble
Explore all questions with a free account
Similar Resources on Quizizz
10 questions
7.5 Standard Methods of Solution Cambridge IGCSE 0478

Quiz
•
10th Grade - University
15 questions
AQA Computer Science GCSE - 3.1 Fundamentals of algorithms

Quiz
•
10th - 12th Grade
11 questions
44. Algorithms - Bubble Sort Algorithm Quiz

Quiz
•
9th - 12th Grade
15 questions
AS Computing: Data Structures

Quiz
•
10th Grade - University
10 questions
Common Algorithms - Bitesize

Quiz
•
KG - 11th Grade
11 questions
GCSE Computer Science Paper 2: Topic 1

Quiz
•
10th Grade
13 questions
Microsoft Word 2016 Tables

Quiz
•
8th - 12th Grade
7 questions
18.10.25. - 2.TR do 3.4.1.

Quiz
•
10th Grade - University
Popular Resources on Quizizz
17 questions
CAASPP Math Practice 3rd

Quiz
•
3rd Grade
15 questions
Grade 3 Simulation Assessment 1

Quiz
•
3rd Grade
20 questions
math review

Quiz
•
4th Grade
19 questions
HCS Grade 5 Simulation Assessment_1 2425sy

Quiz
•
5th Grade
16 questions
Grade 3 Simulation Assessment 2

Quiz
•
3rd Grade
21 questions
6th Grade Math CAASPP Practice

Quiz
•
6th Grade
13 questions
Cinco de mayo

Interactive video
•
6th - 8th Grade
20 questions
Reading Comprehension

Quiz
•
5th Grade