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

Related MCQs

• Best and the worst case timing complexities of insertion sort are_________.
• Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.
• If the characters 'D', 'C', 'B', 'A' are placed in a queue (in that order), and then removed one at a time, in what order will they be removed?
• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
• The time factor when determining the efficiency of algorithm is measured by
• The time factor when determining the effi- ciency of algorithm is measured by
• Two main measures for the efficiency of an algorithm are
• Two main measures for the efficiency of an algorithm are
• Row -major order in two -dimentional array refers to an arrangement where
• If two string are identical then strcmp() function returns____