Give timing complexities of three sorting algorithms bubble sort,selec – McqOptions

MCQOPTIONS

1.	Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.
A.	0(log n), 0(log n), o(log n)
B.	o(n2), o(n2), o(n2)
C.	o(n2), o(n log n), o(n log n)
D.	o(n log n), o(n2), o(n log n)
Answer» C. o(n2), o(n log n), o(n log 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.