What is an algorithm?
17/03/2020
1) Definition and Algorithm: "0.21 S."
- An Algorithm is a set of instructions for solulving some problem step by step.
2) Definition of the Goal: "0.30 S."
- The Goal of an Algorithm is about countig how mutch people is in the room.
3) Pseudo code: "0.43 S"
- The Pseudo code is the language to express the Algorithm.
4) Definition of variable: "0.57 S."
- The Definition of variable is the representig of what we are counting.
5) Definition of loap: "1.17 S."
- The Definition of loap is a sequence of steps that will repeat some numbers of times.
6) Definition of triding an Algorithm: "1.38 S."
- It describe how we will go about countig.
7) How to make algorithm: "2.02 S."
- We start counting something starting at zero then for each on 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) Testing Algorithm
- 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) We test corner cases:
- 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) Definition of brach
- Only executes if there is 1 person in the room , that can not be paired with some one else.
1) Definition and Algorithm: "0.21 S."
- An Algorithm is a set of instructions for solulving some problem step by step.
2) Definition of the Goal: "0.30 S."
- The Goal of an Algorithm is about countig how mutch people is in the room.
3) Pseudo code: "0.43 S"
- The Pseudo code is the language to express the Algorithm.
4) Definition of variable: "0.57 S."
- The Definition of variable is the representig of what we are counting.
5) Definition of loap: "1.17 S."
- The Definition of loap is a sequence of steps that will repeat some numbers of times.
6) Definition of triding an Algorithm: "1.38 S."
- It describe how we will go about countig.
7) How to make algorithm: "2.02 S."
- We start counting something starting at zero then for each on 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) Testing Algorithm
- 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) We test corner cases:
- 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) Definition of brach
- Only executes if there is 1 person in the room , that can not be paired with some one else.
Comments
Post a Comment