Answered step by step
Verified Expert Solution
Question
1 Approved Answer
4. (12 pts.) Skip List Sorting: Let A[1..n] be an array of positive integers, and let r be the difference between the largest and the
4. (12 pts.) Skip List Sorting: Let A[1..n] be an array of positive integers, and let r be the difference between the largest and the smallest value in A. (a) (2pt) Consider the array (5,3,3,7,11,7,7,1,7,3). What is r ? (b) (8pt) Describe an algorithm to sort A. Your algorithm should run in time O(n+r). (Hint: Recall what I said in lecture on 1/24 about what to do to sort a bag of cash) (c) (2pt) When r is constant with respect to n, then this algorithm is faster than the (nlogn) lower bound we covered in class. Explain why the sorting lower bound that we covered in lecture does not apply here
Step 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