Do it Your Self. Thank you very very much. Meiju.Video Autigers.org

(3. 8pts) Computational problem solving: Developing strategies Given a set of n numbers, explain a correct and efficient strategy to find the i largest numbers in sorted order. Your description should be such that the strategy is clear, but at the same time the description should be at the level of strategy (e.g., sort the numbers and list the i largest -- you should devise a different strategy than this obvious one). Then state the total number of steps an algorithm that implements the strategy will have to consider as a function of n