CS502 Fundamentals of Algorithms Assignment No. 02 Solution and Discussion Fall 2014

[Vuhelper]

CS502 Fundamentals of Algorithms Assignment No. 02 Solution and Discussion Fall 2014 Due Date: 09-12-2-14


Uploading instructions
Please view the assignment submission process document provided to you by the Virtual University to upload the assignment.


Question # 1:
(5)

Consider the Merge Sort Algorithm for sorting a set of n points.

What is the total number of comparisons needed for n=15?







Question # 2:
(10)

Solve the following recurrence relation using iterative method and make proper assumptions for final solution and give answer at the end in asymptotic form.