
Sorting Algorithms

Quiz
•
Computers
•
9th Grade
•
Hard
Ms O'Grady
FREE Resource
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Explain the Bubble Sort algorithm.
Bubble Sort algorithm only compares elements once
Bubble Sort algorithm compares adjacent elements and swaps them if they are in the wrong order, repeating this process until the list is sorted.
Bubble Sort algorithm is the fastest sorting method
Bubble Sort algorithm sorts elements randomly
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the time complexity of Bubble Sort?
O(1)
O(nlogn)
O(n^2)
O(n)
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Describe the Insertion Sort algorithm.
Insertion Sort algorithm iterates through the array by consuming one input element at each repetition, and grows a sorted output list. At each iteration, it removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats this process until no input elements remain.
Insertion Sort algorithm sorts elements in descending order
Insertion Sort algorithm randomly shuffles the input elements
Insertion Sort algorithm only works on arrays with a single element
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the best-case time complexity of Insertion Sort?
O(log n)
O(1)
O(n)
O(n^2)
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How does the Selection Sort algorithm work?
Selection Sort algorithm works by sorting the array in descending order.
Selection Sort algorithm works by randomly shuffling the elements in the array.
Selection Sort algorithm works by comparing adjacent elements and swapping them if they are in the wrong order.
Selection Sort algorithm works by finding the minimum element from the unsorted part of the array and swapping it with the first unsorted element.
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the worst-case time complexity of Selection Sort?
O(nlogn)
O(n)
O(1)
O(n^2)
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Explain the Quick Sort algorithm.
Quick Sort algorithm involves merging two sorted arrays together.
Quick Sort algorithm involves selecting the smallest element as the pivot.
Quick Sort algorithm involves sorting the array in reverse order.
Quick Sort algorithm involves selecting a pivot element, partitioning the array around the pivot, and recursively sorting the sub-arrays.
Create a free account and access millions of resources
Similar Resources on Wayground
10 questions
Search and Sort Algorithms

Quiz
•
9th Grade
10 questions
Algorithm Efficiency Quiz

Quiz
•
9th Grade
10 questions
Intro to Computational thinking

Quiz
•
9th Grade
10 questions
Sorting and Searching Algorithms Quiz

Quiz
•
9th Grade
11 questions
Y9 - T1.1 - CrashCourse Algorithms

Quiz
•
9th Grade
10 questions
Algorithms

Quiz
•
9th - 12th Grade
8 questions
CS Edexcel 1.2e Efficiency of Algorithms

Quiz
•
9th - 10th Grade
15 questions
Searches

Quiz
•
9th Grade
Popular Resources on Wayground
15 questions
Hersheys' Travels Quiz (AM)

Quiz
•
6th - 8th Grade
20 questions
PBIS-HGMS

Quiz
•
6th - 8th Grade
30 questions
Lufkin Road Middle School Student Handbook & Policies Assessment

Quiz
•
7th Grade
20 questions
Multiplication Facts

Quiz
•
3rd Grade
17 questions
MIXED Factoring Review

Quiz
•
KG - University
10 questions
Laws of Exponents

Quiz
•
9th Grade
10 questions
Characterization

Quiz
•
3rd - 7th Grade
10 questions
Multiply Fractions

Quiz
•
6th Grade