[Solved]7 12 Pts Design Linear Time Algorithm Input Array Containing N Distinct Integers Arbitrary Q37294861

7. (12 pts) Design a linear-time algorithm that on input an array A containing n distinct integers in arbitrary order, and integers 1,1 satisfying 0 < íくj n, outputs all the elements of the array with ranks from 1 to j. For example, given A – [41,20,10,34,58, 98, 64, 72], and i 3, j-5, the numbers output should be 34, 41,58, since the 3rd smallest element element is 34, and the 5th smallest element is 58. Briefly argue your algorithm’s correctness and running time. Show transcribed image text 7. (12 pts) Design a linear-time algorithm that on input an array A containing n distinct integers in arbitrary order, and integers 1,1 satisfying 0

Expert Answer

---

Answer to 7. (12 pts) Design a linear-time algorithm that on input an array A containing n distinct integers in arbitrary order, a… . . .