The sorting technique where array to be sorted is partitioned again an – McqOptions

MCQOPTIONS

1.	The sorting technique where array to be sorted is partitioned again and again in such a way that all elements less than or equal to partitioning element appear before it and those which are greater appear after it, is called ..
A.	Merge sort
B.	Quick sort
C.	Selection sort
D.	None of these
Answer» C. Selection sort

Discussion

No Comment Found

Related MCQs

The second largest number from a set of n distinct numbers can be found in
A desirable choice for the partitioning element in quick sort is
A character of the data that binary search uses but the linear search ignores, is
A characteristic of the data that binary search uses but the linear search ignores is the___________.
A pivot element to partition unsorted list is used in
A search begins the search with the element that is located in the middle of the array
A sort which relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called
Which one of the below is not divide and conquer approach?
A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is ..
Which sorting algorithm is the best if the list is already in order?