Question
Q2. (Section 1.1.) Write an algorithm that finds the m smallest numbers in a list of n numbers. The input to this problem is n,
Q2. (Section 1.1.) Write an algorithm that finds the m smallest numbers in a list of n numbers.
The input to this problem is n, S, and m. Example if S={16,90,179,10,33,7,89,2139, 37,17,439,105,9} n=13 then The smallest m numbers when m=1 is {7} The smallest m numbers when m=2 is {7,9} The smallest m numbers when m=3 is {7,9,10} The smallest m numbers when m=4 is {7,9,10,16} The smallest m numbers when m=5 is {7,9,10,16,17} etc. Consider the case where the numbers in S are not necessary all of them are district for example, if S={53, 8, 17, 8, 90, 5, 18, 17, 663, 91} n=10, then The smallest m numbers when m=1 is {5} The smallest m numbers when m=2 is {5,8} The smallest m numbers when m=3 is {5,8,17} not {5,8,8} The smallest m numbers when m=4 is {5,8,17,18} not {5,8,8,17} neither {5,8,17,17} etc.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started