0
An algorithm is written in simple English and is not a formal document. An algorithm must:
- be lucid, precise and unambiguous
- give the correct solution in all cases
- eventually end
Also note it is important to use indentation when writing solution algorithm because it helps to differentiate between the different control structures.
1) Finiteness: - an algorithm terminates after a finite numbers of steps. 2) Definiteness: - each step in algorithm is unambiguous. This means that the action specified by the step cannot be interpreted (explain the meaning of) in multiple ways & can be performed without any confusion. 3) Input:- an algorithm accepts zero or more inputs 4) Output:- it produces at least one output. 5) Effectiveness:- it consists of basic instructions that are realizable. This means that the instructions can be performed by using the given inputs in a finite amount of time.
Wiki User
∙ 15y ago
Wiki User
∙ 14y agoUltimately when searching for an algorithm you're looking to find the best combination of speed and low memory use. Obviously the exact requirements will differ depending on your actual implementation and what hardware resources you have available.
Wiki User
∙ 11y agoevery algorithm should have the following four characteristic
1.space efficiency
2.time efficiency
3.simiplicity
4.generality
by
vinodh
Wiki User
∙ 15y agoshould have the following five characteristics:
1. Input
2. Output
3. Definiteness
4. Effectiveness
5. Termination
Wiki User
∙ 10y agoa function that calls itself.
Add your answer:
Earn +20 pts
What are the characteristics of a good algorithm?
Every algorithm should have the following five characteristics: 1. Input 2. Output 3. Definiteness 4. Effectiveness 5. Termination
How do you explain characteristics of algorithm?
Characteristics of algorithms are: Finiteness: terminates after a finite number of steps Definiteness: rigorously and unambiguously specified Input: valid inputs are clearly specified Output: can be proved to produce the correct output given a valid input Effectiveness: steps are sufficiently simple and basic.
What is algorithm and what are its characteristics?
An "algorithm" is simply a method to solve a certain problem. For example, when you use the standard method you learned in school to write down two numbers, one beneath the other, then add them, you are using an algorithm - a method that is known to give correct results in this particular case.
What is algorithm to write algorithm to the program to access a pointer variable in structure?
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?
Black and White bakery algorithm is more efficient.
What are the characteristics of a good algorithm?
Every algorithm should have the following five characteristics: 1. Input 2. Output 3. Definiteness 4. Effectiveness 5. Termination
Characteristics of algorithms?
1. Finiteness 2. Definiteness 3.
How do you explain characteristics of algorithm?
Characteristics of algorithms are: Finiteness: terminates after a finite number of steps Definiteness: rigorously and unambiguously specified Input: valid inputs are clearly specified Output: can be proved to produce the correct output given a valid input Effectiveness: steps are sufficiently simple and basic.
What is algorithm and what are its characteristics?
An "algorithm" is simply a method to solve a certain problem. For example, when you use the standard method you learned in school to write down two numbers, one beneath the other, then add them, you are using an algorithm - a method that is known to give correct results in this particular case.
How are the expanded algorithm and the standard algorithm different?
They are different because standard algorithm is more common then the expanded algorithm
What are the two characteristics of OSPF?
The first is that the protocol is open, which means that its specification is in the public domain. The OSPF specification is published as Request For Comments (RFC) 1247. The second principal characteristic is that OSPF is based on the SPF algorithm, which sometimes is referred to as the Dijkstra algorithm (Answer is from CCNA 3 guide)
What is algorithm to write algorithm to the program to access a pointer variable in structure?
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
Which algorithm is more efficient lamport bakery algorithm or black and white bakery algorithm?
Black and White bakery algorithm is more efficient.
What is complsexity of an algorithm?
Complexity of an algorithm is a measure of how long an algorithm would take to complete given
How algorithm is different from flowchart?
An algorithm is a series of steps leading to a result. A flowchart can be a graphical representation of the algorithm.
How do you test algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
List down the names of any three parameters on which you analyze an algorithm?
what is algorithm and its use there and analyze an algorithm
