State major characteristics of algorithms.

Major characteristics of algorithms are given as follows: An algorithm must have a beginning and an end. 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. Several algorithms for solving the same problem may exist. Algorithms for the same problem can be based on very different ideas and can solve the problem with dramatically different speeds. It must terminate at a reasonable period of time.