What are the characteristics of an algorithm. Describe with an example?

Answer 1

Characteristics of Algorithm

n Finiteness:

F terminates after a finite number of steps

n Definiteness:

F rigorously and unambiguously specified

n Input:

F valid inputs are clearly specified

n Output:

F can be proved to produce the correct output given a valid input

n Effectiveness:

F steps are sufficiently simple and basic.

Read more: Explain_characteristics_of_algorithm

Answer 2

An algorithm is a stepwise sequence of operations that can be performed to solve a problem. The operations are expected to be 'simple', so they can be performed mechanically.

A simple example algorithm is "how to find the largest number in a list of numbers":
- look at the first number and write it down as the largest-so-far
- for each remaining number in the list:
- - replace largest-so-far with this number if this number is larger
- when you have compared all the numbers, largest-so-far is the largest number in the list

A less trivial algorithm is the one people learn in school for multiplying multi-digit numbers, called "long multiplication" or "grade-school multiplication". It becomes rather long if you write down all the steps (as you would need to for an algorithmic description), but it involves multiplying each digit in the first number with each digit in the second number and summing the partial results.
Here the simple operation is multiplying two single digits, which you are expected to know how to do, and by using the algorithm you can extend the knowledge of how to multiply single digits to multiply numbers with any number of digits.

See related links.

Answer 3

explain the input,output, termination, definiteness, effectiveness

Answer 4

While designing an algorithm as a solution to a given problem, we must take care of the following five important characteristics of an algorithm.