Write an algorithm for a program that accepts a set of numbers
and finds the smallest among them and computes the sum of
the numbers accepted. The program stops when the user
enters number 999. Convert the algorithm into flowchart
please answer this
as the numbers are accepted, keep track of the smallest. That way there is no need to do a sort later on.
read least
sum=least
val=least
WHILE val ne 999 DO
read val
sum += val
least = val if val < least
DONE
print least,sum
Of course, an array must be used if the list of numbers needs to be retained for some reason.
rats. The above loop will include the terminating 999 in the sum. It is a simple change to stop before including it.
an algorithm in pseudo-code that accept 10 students marks and output average mark
Design an algorithm that keeps reading positive numbers until the user enters a zero value, and determines and outputs the largest number
To write an algorithm for a program that accepts a set of numbers, finds the smallest among them, and computes the sum, you can follow these steps:
1. Initialize a variable `smallest` with a very large number.
2. Initialize a variable `sum` to 0.
3. Create a loop that continues until the user enters the number 999:
a. Prompt the user to enter a number.
b. Read the input number.
c. If the input number is smaller than the current `smallest`, update the `smallest` variable.
d. Add the input number to the `sum` variable.
4. Display the smallest number found.
5. Display the sum of all numbers entered.
Here is an example algorithm:
```
Initialize smallest with a large number
Initialize sum to 0
Repeat until number is 999:
Prompt user to enter a number
Read the input number
If input number is less than smallest:
Update smallest with input number
Add input number to sum
Display smallest
Display sum
```
To convert this algorithm into a flowchart, you can represent each step as a box or rectangle and connect them using arrows to indicate the order of execution. Here is a possible flowchart representation:
```
Start
|
V
[Initialize smallest]
|
V
[Initialize sum]
|
V
[Read input number]
|
V
[Check if number is 999]
| |
V V
[Update smallest]----[Add number to sum]
|
V
[Read input number]
|
V
[Check if number is 999]
| |
V V
[Update smallest]----[Add number to sum]
|
V
[Read input number]
|
V
[Check if number is 999]
| |
V V
[Update smallest]----[Add number to sum]
|
V
[Read input number]
|
V
[Check if number is 999]
| |
V V
[Update smallest]----[Add number to sum]
|
V
[Check if number is 999]----[Display smallest]
|
V
[Display sum]
|
V
End
```
Please note that this is just one possible representation of the algorithm as a flowchart. The actual flowchart design may vary depending on personal style and preferences.