Algorithms

Algorithms

1. Is the step-by-step of an accion

   • You use the Algorithms to describe an accion,order or a sequence in any case of the life and in the operative system

2. Characteristics

   • 1.Each and every instruction should be precise and unambiguous i.e. each and every instruction should be clear and should have only one meaning. 2. Each instruction should be performed in finite time. 3. One or more instructions should not be repeated infinitely. It means that the algorithm must terminate ultimately. 4. After the instructions are executed, the user should get the required results.
     • http://xpode.com/ShowArticle.aspx?ArticleId=89
     • Precision
     • Uniqueness
     • Finiteness
     • Input
     • Output

3. Examples

   • How to turn on the TV
     • 1°localize the tv
       • 2°Identify the remote control
         • 3°Push the On buttom
           • 4° Sit down and enjoy your favorite program

4. Example of a complicated algorithm

   • How to install a new equip of internet
     • 1° you go to the phone store
       • 2° you pay your package of internet or telephone
         • 3° you wait the enginer to instal the equip in your house
           • 4° the enginer install the equip
             • 5° You connect your computer to the internet
               • 6° you pay until you dont want the sevice
                 • 8° if you don´t want the service anymore you cancel it