Course Solutions Uncategorized (Solved) : Csc 313 Data Structures Exam 3 Fall 2016 3 9 11 3pts T Complexity Mergesort Satisfies Foll Q28863447 . . . .

(Solved) : Csc 313 Data Structures Exam 3 Fall 2016 3 9 11 3pts T Complexity Mergesort Satisfies Foll Q28863447 . . . .

 

CSC 313 Data Structures Exam 3 Fall 2016 3 of 9 11ยท (3pts) T he complexity of MergeSort satisfies the following recursive formula A. T(n) = 2T(n/2) + ?(n2) B. T(n) T(n/2) + e(n) C. T(n) 2T(n2)+e(n) 12. (3pts) Any algorithm that uses only element comparison to sort an input of n elements has lower bound complexity of A. (n2) B. 2(n2 log n) D. It depends on the algorithm 13. (3pts) Any algorithm that uses only comparison of adjacent elements to sort an input of n elements has lower bound complexity of B. (n2 log n) C. ?(n*) D. It depends on the algorithm

CSC

OR

PayPal Gateway not configured

OR

PayPal Gateway not configured

Leave a Reply

Your email address will not be published. Required fields are marked *

Related Post