Draw a flowchart to find the smallest number among 'n' numbers.
Answers
Answered by
14
Answer:
Explanation:
Flowchart to find the smallest number among 'n' numbers.
step 1: Take n number of inputs within an array
step 2: Consider first element as smallest.
smallest = a[0];
step 3: for (i = 0; i < num; i++).. within this loop compare which one is smallest
if (a[i] < smallest)
{ smallest = a[i]; }
step 4: Print the value of smallest..
Answered by
0
Explanation:
flowchart to find smallest number among n numbers
Similar questions
English,
6 months ago
Math,
6 months ago
Computer Science,
6 months ago
Chemistry,
1 year ago
English,
1 year ago
Physics,
1 year ago
Environmental Sciences,
1 year ago