CS Fundamentals: Sorting Algorithms
Test your knowledge of sorting algorithms — the classic algorithms every programmer eventually studies, from simple bubble sort to efficient quicksort.
Questions cover time complexity of common sorting algorithms, which algorithms are stable, and how divide-and-conquer approaches like merge sort actually work.
Sorting is one of the most-studied problems in computer science for a reason — see how well you know the trade-offs.
Start quiz →
Opens in a new tab on Cletica
Sample questions3 of 13 shown
Q1
What is the time complexity of Bubble Sort in the worst case?
Q2
Which sorting algorithm uses the 'divide and conquer' strategy?
Q3
Which of the following sorting algorithms are stable? (Select all that apply)
What This Quiz Covers
- Bubble sort and selection sort
- Merge sort and divide-and-conquer
- Quicksort and pivot selection
- Time complexity comparisons
- Stable vs. unstable sorts
- Best and worst case scenarios
Cletica
Want to create your own quiz?
Build surveys and quizzes, share with anyone, collect responses — free to start.
Try Cletica for free →