is the complexity of the merge sort algorithm for both worst and average case.
A. O(n log n).
B. O(n log+n).
C. O(n+logn).
D. O(logn).
ANSWER: A
is the complexity of the merge sort algorithm for both worst and average case. Read More »
A. O(n log n).
B. O(n log+n).
C. O(n+logn).
D. O(logn).
ANSWER: A
is the complexity of the merge sort algorithm for both worst and average case. Read More »
A. Bubble Sort.
B. Insertion Sort.
C. Quick Sort.
D. Merge Sort.
ANSWER: C
Which of the following sorting algorithm is of divide-and-conquer type. Read More »
A. Merge.
B. Heap.
C. Radix.
D. Bubble.
ANSWER: C
……..sorting is good to use when alphabetizing large list of names. Read More »
A. inserting.
B. mixing.
C.merging.
D. sharing.
ANSWER: C
A. middle element.
B. largest element.
C. last element.
D. smallest element.
ANSWER: D
Selection sort first finds the……element in the list and put it in the first position. Read More »
A. basic key.
B. primary key.
C. starting key.
D. index key.
ANSWER: B
Sorting a file F usually refers to sorting F with respect to a particular key called Read More »
A. mn.
B. max(m,n).
C. min(m,n).
D. m+n-1.
ANSWER: D
A. insertion sort.
B. heap sort.
C. bubble sort.
D. quick sort.
ANSWER: A
Very slow way of sorting is Read More »
A. Merge sort.
B. Selection sort.
C. Insertions sort.
D. Radix sort.
ANSWER: B