Design an alogorith to check whether a number is divisible by 5 or not.
Sᴏʟᴠᴇ ᴋᴀʀᴏ!
Answers
Answered by
2
Step 1: Start the algorithm.
Step 2: Read the number by the user in variable "x".
Step 3:Test the condition if n mod(%) 2 equals 0 then move to Step 4 .otherwise Move to Step 5.
Step 4: Display " Number is divisible by 5 ".
Step 5: Display " Number is not divisible by 5 ".
Step 6: End the algorithm.
In this, we used % to check the particular condition.
Answered by
2
Oh nice me dankuni me rahe ti hu
Similar questions