McqMate
Login
Register
Home
Search
Login
Register
Computer Science Engineering (CSE)
Data Structures (DS)
Who invented Quick sort procedure?
Q.
Who invented Quick sort procedure?
A.
Hoare.
B.
Sedgewick.
C.
Mellroy.
D.
Coreman.
Answer» A. Hoare.
View all MCQs in:
Data Structures (DS)
Discussion
Comment
Related Questions
Selection sort and quick sort both fall into the same category of sorting algorithms._________ is that category.
The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
Quick sort uses ____ for implementation.
The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
LSD radix sort requires passes to sort N elements.
The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is ____________.
What is the worst-case time for heap sort to sort an array of n elements?
Login to Continue
It will take less than 2 minutes
Continue with Google
Continue with Linkedin
Continue with Twitter
Report MCQ
Remark*
Report