➤ An algorithm must have a clear and unambiguous specification of the steps to be followed.
➤ An algorithm must have a well-defined input and output.
➤ An algorithm must be finite, meaning it should terminate after a finite number of steps.
➤ An algorithm must be effective, meaning each step should be basic enough to be performed in a finite amount of time.
➤ An algorithm must have a clear and unambiguous specification of the steps to be followed.
➤ An algorithm must have a well-defined input and output.
➤ An algorithm must be finite, meaning it should terminate after a finite number of steps.
➤ An algorithm must be effective, meaning each step should be basic enough to be performed in a finite amount of time.