Question: Unless otherwise stated give OO time complexity for the worst case. Answers should be as simple and precise as possible to attract maximum marks a.

Unless otherwise stated give "OO" time complexity for the worst case. Answers should be as simple and precise as possible to attract maximum marks a. What is the complexity of n queue operations in a simple linked list implemented queue? b. What is the complexity of mergesort? c. What is the complexity of straight radix sort (assume the number of bits is a con- stant)? d. Fill in the blanks: g(n) = O(f(n)) if and only if e. What is the complexity of search in the binary search algorithm? f. What is the complexity of simple binary search tree insertion? g. What is the complexity of searching in a red-black tree? h. What is the complexity of insert in a priority queue implemented as an ordered array? i. What is the complexity of list insertion sort for a sorted file? j. What is the complexity of quicksort with median partitioning for a reverse sorted file? k. What is the average case complexity of insertion in a binary search tree? I. What is the average case complexity of red-black tree insertion? m. What is the average case complexity of quick sort? n. What is the best case complexity of heap sort? o. What is the best case complexity of Shell sort? p. What is the best case complexity of radix exchange sort? q. What is the space complexity of top down merge sort for linked lists? r. What is the space complexity of Sedgewick's top down merge sort for arrays? s. If the running time of an algorithm is expressed as the recurrence CN-2CN/2+ N, G = 1, then what is the complexity
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
