
Sorting Algorithms
Authored by Pavan Jakkepalli
Computers
University
Used 65+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
14 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which of the following is not a stable sorting algorithm?
Bubble sort
Selection sort
Quick sort
None of these
2.
MULTIPLE SELECT QUESTION
1 min • 1 pt
Which of the following is/are in-place sorting algorithm(s)?
Selection sort
Bubble sort
Quick sort
Merge sort
3.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
The worst-case time complexity of a quick sort algorithm?
O(nlogn)
O(logn)
O(n^2)
O(n^2logn)
4.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
The no.of comparisons in first pass in bubble sort to sort n numbers is....?
n
n(n-1)/2
n-1
n^2
5.
MULTIPLE CHOICE QUESTION
45 sec • 1 pt
The maximum no.of swappings in first pass of selection sort to sort n numbers is....?
1
n(n-1)/2
n-1
n^2
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In quick sort, based on key or pivot element position, the list is partitioned into how many sub-lists?
1
2
3
4
7.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
If the list is almost sorted, then which of the following algorithm gives the better performance?
Bubble sort
Selection sort
Quick sort
All of these
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?