(A) There is explicit combine process as well to conquer the solutin
(B) No work is needed to combine the sub-arrays, the array is already sorted
(C) Merging the subarrays
(D) None of above
Category: Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
Quick sort is __.
(A) Stable & in place
(B) Not stable but in place
(C) Stable but not in place
(D) Some time stable & some times in place
One example of in place but not stable algorithm is?
(A) Merger Sort
(B) Quick Sort
(C) Continuation Sort
(D) Bubble Sort
In stable sorting algorithm?
(A) If duplicate elements remain in the same relative position after sorting
(B) One array is used
(C) More than one arrays are required
(D) Duplicating elements not handled
Continuation/counting sort is suitable to sort the elements in range 1 to k?
(A) K is Large
(B) K is not known
(C) K may be small or large
(D) K is small
An in place sorting algorithm is one that uses __ arrays for storage.
(A) Two dimensional arrays
(B) More than one array
(C) No Additional Array
(D) None of the above
In counting sort, once we know the ranks, we simply __ numbers to their final positions in an output array.
(A) Delete
(B) Copy
(C) Mark
(D) arrange
Merge sort is stable sort, but not an in-place algorithm?
(A) True
(B) False
(C) NA
(D) NA