Sorting Algorithms
Authored by Paul Greenwood
Computers
12th Grade
Used 334+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
20 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
moving through a list repeatedly, swapping elements that are in the wrong order
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
2.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
uses two lists, one for sorted elements and one for unsorted elements.
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
3.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
Splits a list into individual elements, joining together in multiples of 2 until one sorted list is left
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
4.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
One item at a time / serially … …moved into correct position… …until all items in list checked
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
5.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
•Has a consistent running time, regardless of how the items are ordered in the original list
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
6.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
7.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
•Is regarded as one of the best sorting algorithms
Bubble Sort
Insertion Sort
Merge Sort
Quick 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 Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
