Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

henpen

  • 3 years ago

Algorithm question: why does the sign of m matter, but not the sign of n? Algorithm: 1-Read the positive integers m and n 2- Replace m by m-1 and n by n+1 3- If n>0, go to step 2. Otherwise, write n. Or is my book incorrect?

  • This Question is Closed
  1. fatemeh8989
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I dont know what was the subject for writing this algorithm... but actually the parameter "m" has not any role ( does nothing ) this algorithm has bugs too. it works for n<0 ; and will repeat ( n <--- n+1) until n>0 but if n already be greater then 0 ( when we enter it ) then this is an infinite loop. so if you think that there is some other points, let's discuss. :)

  2. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy