Write a step-by-step procedure called an algorithm that describes how to enjoy a cup of tea.
One possible solution of the tea algorithm:
```
Enjoy a cup of tea
Heat water
Fill kettle with water
Take kettle to sink Remove kettle cover Turn on cold water Put kettle under faucet until nearly full
Turn off water
Put cover on kettle Heat kettle
Take kettle to range Place on burner
Turn on burner to high heat
Wait until water boils Turn off burner
Brew tea
Take teapot to range
Take box of tea bags to range Put tea bags in teapot
Open box of tea bags Remove 4 tea bags Close box
Take top off teapot
Put tea bags into teapot
Pour hot water into teapot
Take hot kettle from range
Fill teapot with hot water Replace kettle on stove Replace top on teapot
Wait 5 minutes
Drink tea
Bring teapot and cup to table Sit down at table
Repeat following until (pot is empty or you are full)
Pour tea from teapot into cup until cup is nearly full Repeat until (cup is empty or you are full)
Take a sip of tea
Enjoy the moment
Wait a while End repeat
End repeat
```
You might also like to view...
In a table, column width can be changed either by dragging the column border or by using the Width button spin arrow on the Ribbon
Indicate whether the statement is true or false
____ develop the logic in a game, especially for strategy games in which a user may play against the computer.
A. Artificial Intelligence programmers B. Graphics programmers C. Math programmers D. Physics programmers
A selected graphic, as shown in the accompanying figure, appears surrounded by a(n) _________________________, which has small squares and circles around its edges.
Fill in the blank(s) with the appropriate word(s).
Answer the following questions true (T) or false (F)
1. STL ranges [first, last) are always ‘half-open’ – from the first element to a designation for one past the last element. 2. Given a map m, the expression m["value"] will return NULL if there is no string named "value" stored in the map.