An algorithm must indeed be finite, definite, and effective. In our textbook, the example is always sorting numbers. But for me, a true example is my grandmother's method for pressing a Banarasi saree: her steps are a fixed sequence, each motion is precise, and it always results in a perfectly steamed saree. This is more real than any textbook code, because if the sequence were not definite, the delicate zari would get damaged.
#exams#study
Jump in to reply — no account needed.