what is an algorithm???


DEFINITION

 in informatics an algorithm is a series of instructions to solve a problem, typically algorithms are executed exclusively by computers, but humans also have algorithms

                                                              EXAMPLE
Examples are user manuals, which show algorithms for using a device, or instructions that a worker receives from his employer. ... In terms of programming, an algorithm is a sequence of logical steps that allow solving a problem.

                     

Comments

Post a Comment

Popular posts from this blog

jaz

1.  Algorithm:    an Algorithm is a set of instructions for solving a problem step by step. 2. Goal: the goal is about to count people in the room. 3. Pseudo code: the pseudo code is the language of programming. 4. Variable: variable is a letter that is equal to zero. 5 Loop: a loop is a sequence of steps that will repeat some number of times. 6. How to test an algorithm: it describe how we will go about counting. 7  How to make an algorithm: we start counting something starting at zero then for each one in the room we increment N by 1. so in the first trip trough the loop, we uptraid N from zero  to 1 on the second trip thought that same loop. 8 Testing algorithm: if you want to count people in a room, and in the room are 3 people, the result will be 3. If the answer isn't 3, then the algorithm is wrong.  9 We test corner cases: Suppose that are zero people in the room, we initialize N equal to zero but this time line doesn't execut...
Read more
1. An algorithm was a set of instructions for solving some Problem step by step. 2. The goal of an Algorihtm is about counting how much people is in the room. 3. The pseudo code is the language to express the Algorithm. 4. The definition of variable is the representing of what we are counting. 5. The definition of loap is a sequence  of steps that will repeat some numbers of times. 6. It describe how we will go about counting. 7. We start counting something starting at zero then for each on in the room we increment N by 1. So in the first trip of the trough of the loop, we uptraid n from zero to 1. 8. If there are 5 people in the room the results have to be 5 if it isn’t like that then this algorithm is wrong. 9. The corner case is a case that is not typical. To test the corner cases they try to know if the algorithm functions with 0 persons in a room. 10. Only executes if there is 1 person in the room, that can not be paired with some one else.
Read more