
2. (5 pts.) Give a detailed description of an algorithm (pseudo code) that will sort n integers in the range 1 to n in O(n) time. Be sure to justify why your algorithm takes O(n) time. Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .