4 10 pts if we add one more partition step in find pivot function in s
4. (10 pts.)If we add one more partition step in find-pivot function in selecting problem, and use 3 as the size of each subarray, the algorithm would become: function find-pivot (A, k) Partition A into n/3 subarrays; Let M be the list of medians of these n/3 subarrays; Partition M into n/9 subarrays; Let M' be the list of medians of these n/9 subarrays;return selection(M',M' /2) end function; Analyze the running time of the new selection algorithm with the find-pivot function described above.
*The amount will be in form of wallet points that you can redeem to pay upto 10% of the price for any assignment. **Use of solution provided by us for unfair practice like cheating will result in action from our end which may include permanent termination of the defaulter’s account.Disclaimer:The website contains certain images which are not owned by the company/ website. Such images are used for indicative purposes only and is a third-party content. All credits go to its rightful owner including its copyright owner. It is also clarified that the use of any photograph on the website including the use of any photograph of any educational institute/ university is not intended to suggest any association, relationship, or sponsorship whatsoever between the company and the said educational institute/ university. Any such use is for representative purposes only and all intellectual property rights belong to the respective owners.