Carta PAYBACK di Mondadori
Su Mondadori Store, con la tua carta PAYBACK ti premi ad ogni acquisto.
The notion of the algorithm illustrates some important points:
The non-ambiguity requirement for each step of an algorithm cannot be compromised.
The range of inputs for which an algorithm works has to be specified carefully.
The same algorithm can be represented in several different ways.
There may exist several algorithms for solving the same problem.
Algorithms for the same problem can be based on very different ideas and can solve the problem with dramatically different speeds.
Characteristics of an algorithm:
Input: Zero / more quantities are externally supplied.
Output: At least one quantity is produced.
Definiteness: Each instruction is clear and unambiguous.
Finiteness: If the instructions of an algorithm is traced then for all cases the algorithm must terminates after a finite number of steps.
Efficiency: Every instruction must be very basic and runs in short time.
Scrivi una recensione per "DESIGN AND ANALYSIS OF ALGORITHMS"
Torna in cima
Leggi un estratto
dai un voto
