Answered step by step
Verified Expert Solution
Question
1 Approved Answer
This is all one question. Answer in Pseudocode (not any specific language) then state recurrence that expresses worst case running time. Consider the problem of
This is all one question. Answer in Pseudocode (not any specific language) then state recurrence that expresses worst case running time.
Consider the problem of sorting the odd elements in a list of integers while keeping the even ones unchanged in their original places. Sort the odd elements in a list (ODDSORT) Input: A[1...n] a list of integers. Output: List A'[1...n] such that A'[i] = A[i] if A[i] is even, and A'[i] = A'[j] for all I sis isn such that A'[i] and A'[iare both odd. (1 point) Below is another self-reduction for the ODDSORT problem. State a recursive algo- rithm using pseudocode for solving the ODDSORT problem based on this self-reduction. pairsort(A[a], A[b]) if a b if b= a +1 if b> a+1 SOS(A[a...b]) = with A' SOS(A[a... t2|| A[t2 +1...b] A'la... 011 || SOS(A' [ 11 +1...b) SOSCA"[a... t21 || A' [t2 + 1...b] (2+2 points) Using the same reduction as in the previous question, state a recurrence T'(n) that expresses the worst case running time of the recursive algorithm. From this recurrence, find a tight (Big-Theta) expression for T'(n). Hint: the Master Theorem may be the easiest solution here. Consider the problem of sorting the odd elements in a list of integers while keeping the even ones unchanged in their original places. Sort the odd elements in a list (ODDSORT) Input: A[1...n] a list of integers. Output: List A'[1...n] such that A'[i] = A[i] if A[i] is even, and A'[i] = A'[j] for all I sis isn such that A'[i] and A'[iare both odd. (1 point) Below is another self-reduction for the ODDSORT problem. State a recursive algo- rithm using pseudocode for solving the ODDSORT problem based on this self-reduction. pairsort(A[a], A[b]) if a b if b= a +1 if b> a+1 SOS(A[a...b]) = with A' SOS(A[a... t2|| A[t2 +1...b] A'la... 011 || SOS(A' [ 11 +1...b) SOSCA"[a... t21 || A' [t2 + 1...b] (2+2 points) Using the same reduction as in the previous question, state a recurrence T'(n) that expresses the worst case running time of the recursive algorithm. From this recurrence, find a tight (Big-Theta) expression for T'(n). Hint: the Master Theorem may be the easiest solution hereStep by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started