Ii Partial Sorting 10 Points Given Input Array N Design Efficient Algorithm Return Smalles Q37078210

II. Partial Sorting (10 points) Given an input array A[I..n], design an efficient algorithm to return the smallest k elemertoe the array in sorted order, where k is much smaller than n. Present your algorithm and running time. You can use any algorithm we learned in the course, and use an auxili needed. anal yze its Show transcribed image text II. Partial Sorting (10 points) Given an input array A[I..n], design an efficient algorithm to return

OR

 

OR