i want to three problem solution. i dont know how can i solve problem1 Design a

Question

i want to three problem solution.
i dont know how can i solve

problem1 Design a recursive algorithm that computes the following problem which uses exactly 3/2 n 2 comparisons input: n distinct integers. where n is a power of 2 (ie.. n can be 2. 4. 8. 16.) output maximum and minimum Iproblem 2 Show that the solution of the following recurrence equation is T(n) = nologn using mathematical induction. if n-2 T(n/2) + n if n=2k for k > 1 lproblem 3 Why do we analyze the average case performance of randomized algorithms and not its worst case performance?

Explanation / Answer

Problem-(3)--- Why do we analyze the average case performance of randomized algorithms and not its worst case performance?

Solution----- In a randomized algorithm , the worst case is not a matter of the input but only of luck. Thus we want to know want kind of luck to expect.Every input we can see is drawn from the uniform distribution.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---