Tright here are various ways of composing an algorithm. Today, I"m going to explain 3 ways of writing an algorithm.

You are watching: Which of the following is not a way of representing algorithms?

1. English-Like Algorithm

An algorithm have the right to be created in many ways. It can be written in easy English however this technique additionally has some demerits. Natural language have the right to be ambiguous and therefore absence the characteristic of being definite. Each action of an algorithm should be clear and also shouldn"t have more than one interpretation. English language-prefer algorithms are not taken into consideration excellent for the majority of of the tasks.

2. Flowchart

Flowcharts pictorially depict a procedure. They are straightforward to understand and also are frequently supplied in the case of straightforward problems.


Flowchart Conventions


3. Pseudocode

The pseudocode has an advantage of being quickly converted right into any programming language. This way of composing algorithm is a lot of acceptable and also many widely supplied. In order to compose a pseudocode, one must be acquainted via the conventions of writing it.

1. Single line comments start via // 2. Multi-line comments occur in between /* and also */ 3. Blocks are represented utilizing brackets. Blocks have the right to be offered to recurrent compound statements or the steps.


4. Statements are derestricted by semicolon. 5. Assignment statements suggests that the outcome of testimonial of the expression will certainly be stored in the variable.


6. The boolean expression "x > y" retransforms true if x is greater than y, else retransforms false. 7. The boolean expression "x 8. The boolean expression "x 9. The boolean expression "x >= y" returns true if x is higher than or equal to y, else returns false. 10. The boolean expression "x != y" retransforms true if x is not equal to y, else retransforms false. 11. The boolean expression "x == y" retransforms true if x is equal to y, else retransforms false. 12. The boolean expression "x AND y" returns true if both conditions are true, else retransforms false. 13. The boolean expression "x OR y" retransforms true if any type of of the problems is true, else returns false. 14. The boolean expression "NOT y" retransforms true if the outcome of x evaluates to false, else retransforms false. 15. ifthen 16. This condition is an improvement of the over "if" statement. It have the right to additionally handle the situation wright here the problem isn"t satisfied.

See more: The Ones Who Walk Away From Omelas Literary Analysis, The Ones Who Walk Away From Omelas Analysis


17. switch case (C or C++)

instance :: ..... ..... ..... :: :default:

18. while loop

whileperform statements

19. do-while loop

repeat statementsuntil

20. for loop

for variable = value1 to value2 statements

21. input instruction


22. Output instruction


23. The name of the algorithm is and also the disagreements are stored in the

Algorithm ()

Note: Number 6 to Number 11 usage relational operator, Number 12 to 14 uses logical operator, and also Number 15 supplies conditional operator.