Algorithm is the main content of information mathematics engineering or computer science. To make a good algorithm you must make sort steps to solve the problem in well organized and should not think in one way to solve the problem. The most error in algorithm making is thinking in one way. Let's see the detail explanation and example to get better understanding.
1. Definition of Algorithm
A. Sort steps to solve the problems.
B. Sort steps to take reasonable decision in order to solve the problem.
2. Important Aspect in Algorithm
B. Sort steps to take reasonable decision in order to solve the problem.
2. Important Aspect in Algorithm
A. Finiteness
Algorithm stop after a finite number of steps.
B. Definiteness
Each steps be definited well, musn't ambiguous.
C. Input
Algorithm have input >= 0.
D. Output
Algorithm have output >= 1.
E. Effectivenes
Each algorithm have effective characteristic.
3. Example of Algorithm
A. How to wash your hand
1. Turn on the water tap.
2. Rinse your hands.
3. Turn off the water tap.
4. Wash your hand with soap.
5. Turn on the water tap
6. Clean up your soapy hands with water.
7. Turn off the water tap
8. If your hand already clean and fragrant, go to step number 9. But if doesn't already, back to step number 4.
9. Dry up with towel.
B. Send mail to friend using envelope
1. Write mail in the paper.
2. Put into envelope.
3. Write the address on the envelope. If you remember, go to step no 4. But if don't, see on address book then go to step no 4.
4. Write the address on the envelope.
5. Adhere postage stamp.
6. Go to post office to post your mail.
4. Advance example on program
A. Find uneven number and whole number
1. Input n = 0.
2. Input the number.
3. Counter n = n + 1.
4. Divide the number with 2.
5. If the result have remainder, it is uneven number, If not, it is whole number.
6. If you want to finish end this step but if you don't want back to step number 2.
B. Find root from positive round number.
1. Input n = 0.
2. Input the number.
3. If the number < 0, back to step before. If not, go to next step.
4. Counter n = n +1.
5. Calculate x = number*^1/2.
6. Display root from positive round number is x.
7. If you want to finish end this step. But if you don't want, back to step number 2.
C. Calculate mean of value of exam students
1. Input n =0.
2. Input the_value_of_exam = 0.
3. Input x (the value of exam a student).
4. Counter n = n + 1.
5. Counter the_value_of_exam = the_value_of_exam + x.
5. If you want to add more value of exam, back to step number 2. But if you don't want, go
to step number 5.
6. Devide the_value_of_exam with n.
To make algorithm easier, please facilitate with flowchart. Thanks!
Algorithm stop after a finite number of steps.
B. Definiteness
Each steps be definited well, musn't ambiguous.
C. Input
Algorithm have input >= 0.
D. Output
Algorithm have output >= 1.
E. Effectivenes
Each algorithm have effective characteristic.
3. Example of Algorithm
A. How to wash your hand
1. Turn on the water tap.
2. Rinse your hands.
3. Turn off the water tap.
4. Wash your hand with soap.
5. Turn on the water tap
6. Clean up your soapy hands with water.
7. Turn off the water tap
8. If your hand already clean and fragrant, go to step number 9. But if doesn't already, back to step number 4.
9. Dry up with towel.
B. Send mail to friend using envelope
1. Write mail in the paper.
2. Put into envelope.
3. Write the address on the envelope. If you remember, go to step no 4. But if don't, see on address book then go to step no 4.
4. Write the address on the envelope.
5. Adhere postage stamp.
6. Go to post office to post your mail.
4. Advance example on program
A. Find uneven number and whole number
1. Input n = 0.
2. Input the number.
3. Counter n = n + 1.
4. Divide the number with 2.
5. If the result have remainder, it is uneven number, If not, it is whole number.
6. If you want to finish end this step but if you don't want back to step number 2.
B. Find root from positive round number.
1. Input n = 0.
2. Input the number.
3. If the number < 0, back to step before. If not, go to next step.
4. Counter n = n +1.
5. Calculate x = number*^1/2.
6. Display root from positive round number is x.
7. If you want to finish end this step. But if you don't want, back to step number 2.
C. Calculate mean of value of exam students
1. Input n =0.
2. Input the_value_of_exam = 0.
3. Input x (the value of exam a student).
4. Counter n = n + 1.
5. Counter the_value_of_exam = the_value_of_exam + x.
5. If you want to add more value of exam, back to step number 2. But if you don't want, go
to step number 5.
6. Devide the_value_of_exam with n.
To make algorithm easier, please facilitate with flowchart. Thanks!
I like the way you explain that one word simply :D
ReplyDeleteoh btw, I'm Alicia. maybe you still remember me? :)
Thank you Alicia,,
ReplyDelete