S
to every other node is computed most efficiently, in terms of time complexity, by?n
vertices and m
edges has time complexity __________ ?n/2
times in a sorted array of n
integers?4
is built from scratch by 10
successive insertions. What is the maximum number of node splitting operations that may take place?This is for Tests
n
vertices and 2n-2
edges. The edges of G can be partitioned into two edge-disjoint spanning trees. Which of the following is NOT true for G?n
elements and wish to insert n
more elements(not necessarily one after another) into this heap. Total time required for this is?n
elements using selection sort, in the worst case?n
elements, the (n/4)th
smallest element is selected as Pivot using an O(n)
time algorithm. What is the worst case time complexity of the Quick Sort?10^k
records. Package A requires 0.00001 n^2
time units and package B requires 10nlog(n)
[Base of log is 10] time units to process n
records. What is the smallest value of k
for which B will be preferred over A?This is for Tests
W(n)
and A(n)
denote respectively, the worst case and average case running time of an algorithm executed on an input of size n
. Which of the following is ALWAYS TRUE?n
discs is?n2^n
elements is?n
strings, each of length n
, is sorted into lexicographic order using the Merge-Sort algorithm. The worst case running time of this computation is?