Algorithm

Algorithm

1. DEF: A step by step procedure of problem solving. And so is the program. So what is the difference ?

   • The Algorithm is used in the step of design.
     •  It can be written in any language inthe world, but it should be understood by both the programmer and the designer. The designer should be someone who has domain knowledge, like a doctor, a lawyer or business women....
   • The program is used in step of testing

2. A Algorithm should characterized by :

   • 1/ Input ( it should at least can takeone data or more. For example, when your cooking you get ingredients).
   • 2/ Output (the results. For the cooking example, we should at least one dish or more) .
   • 3/ Defiteness ( you are using a recipe, so you are not just doing whtever or doing something magical).
   • 4/ Finiteness (you will certainly finish at some poin, and your dish will be ready to be served).
   • 5/ Effectiveness ( you are not going to do some unecessary steps, that you will not need in your procedure).

3. How to write and analyse an an algorithm

   • ANALYZE: Criteria
     • Time : it should be faster and be a function
       • each statement take one unit of time. For example, we have 3 simple statements, then f(n) = 3  It is of order 1. O(1) which means it is a constant
     • Space : how much memory space it will consume
       • Each variable represent a word. For example, we have 3 simple statements, then f(n) = 3 It is of order 1. O(1) which means it is a constant
     • Network consuption: how much data will be transferred
     • Power : how much power it consumes
     • CPU registers : how uch these memories ( registers ) consume
   • WRITE : the language does not matter actually, you can communicate the message using every word or symbol you know, so that you can express the statement