An algorithm is made up of two independent time complexities f (n) and – McqOptions

MCQOPTIONS

1.	An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of
A.	f(n) x g(n)
B.	max ( f(n),g(n))
C.	min (f(n),g(n))
D.	f(n) + g(n)
Answer» C. min (f(n),g(n))

Discussion

No Comment Found

Related MCQs

What is the similarity between structure,union and enum?
What will be output if you will compile and execute the following c code? #include#define max 5;int main(){int i=0;i=max++;printf("%d",i++); return 0;}
What is the number of swaps required to sort n elements using selection sort, in the worst case?
The link list also contains a list pointer variable called start or ________.
The memory address of fifth element of anarray can be calculated by the formula
If string 1 = John, and string 2 = Rivers are merged, the process is called ----
When in order traversing a tree resulted E AC K F H D B G; the preorder traversal would return
_________ is a search for data that uses an index to locate the item.
_______ is a variable whose length may vary during the execution, but the length cannot exceed a maximum values defined before the program is executed.
_______ is a merge sort that sorts a data stream using repeated merges.