design an algorithm that keeps on reading numbers until the user enters-1and them determines and out puts the largest number .using pseudo codeand flow chart
x = 0
1 read n
if n = -1, go to 2
if n > x then x = n
go up to 1
2 print x
end
start- (using start process)
enter number-(using input process)
number not equal to -1 (using decision)
if yes back to enter number
if no end(using End)
To design an algorithm that reads numbers until the user enters -1 and determines and outputs the largest number, you can follow these steps:
1. Set a variable "largest" to store the largest number inputted.
2. Set largest initially to a very small number or to negative infinity.
3. Start a loop to read numbers until the user enters -1.
4. Inside the loop, read an input number from the user.
5. Check if the input number is greater than the current largest number.
6. If the input number is greater, update the largest variable with the new input number.
7. Continue the loop until the user enters -1, at which point the loop will terminate.
8. Output the largest number.
Here is a possible implementation in pseudo code:
```
largest = -infinity
loop:
input = readInputNumber()
if input == -1:
exit loop
else if input > largest:
largest = input
output largest
```
And here is a possible flow chart representation of the algorithm:
```
start
|
V
Read input
|
V
Is input = -1?
|
V
No: Is input > largest?
|
V
Yes: Update largest = input
|
V
Continue loop
|
V
Is input = -1?
|
V
Yes: Output largest
|
V
End
```
Note: In the flow chart, "Read input" and "Output largest" are represented as input/output operations, while the decision points are represented as diamond-shaped symbols. The loop is represented by an arrow that goes back to the "Read input" step until the condition is met.