Question: 1) Create an algorithm for the Selection Problem (as defined below) based upon bubble sort algorithm (for a different problem, sorting problem). Note that you

1) Create an algorithm for the Selection Problem (as defined below) based upon bubble sort algorithm (for a different problem, sorting problem). Note that you CANNOT just sort the whole list, and then return the a[k]. Write the pseudocode below, with comments that explain why the algorithm is correct. Problem: Find the kth largest element in a list Input: list a[1...n], k (an integer in the range of 1...n) Output: return the kth largest element stored in a[l...n] Example: ifk-1, returns the largest element in a[l...n] If k-2, returns the second largest element in a[..n]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
