a). (5 marks) Fill in the relationship between each pair of the functions below. (Use N,...

 

Transcribed Image Text:

a). (5 marks) Fill in the relationship between each pair of the functions below. (Use N, O, e, or none of the above) n n+n/log(n) n (1) 30030 n* log(n) (2/3)" 2" b). (5 marks) Answer following questions. loxa(n) n (3/2)" What is the worst case time complexity of constructing Huffman coding tree? What is the average case time complexity of quicksort? What is the worst case time complexity of heap construction (heapification)? What is the worst case time complexity of sequence comparison algorithm? What is the lower bound for sorting algorithm based on comparison? a). (5 marks) Fill in the relationship between each pair of the functions below. (Use N, O, e, or none of the above) n n+n/log(n) n (1) 30030 n* log(n) (2/3)" 2" b). (5 marks) Answer following questions. loxa(n) n (3/2)" What is the worst case time complexity of constructing Huffman coding tree? What is the average case time complexity of quicksort? What is the worst case time complexity of heap construction (heapification)? What is the worst case time complexity of sequence comparison algorithm? What is the lower bound for sorting algorithm based on comparison?