(a) The complexity of merge sort is T(n) = 2T(n/2)+n. Explain how the above equation is derived? (b) What are the tasks of linker and loader?…
(a) The complexity of merge sort is T(n) = 2T(n/2)+n. Explain how the above equation is derived?
(b) What are the tasks of linker and loader? Describe briefly using examples.
From the BPSC Assistant Programmer (CSE) July 2023 – Written exam, question 1 of 8.