• anonymous
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?
Discrete Math
  • Stacey Warren - Expert
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
  • katieb
I got my questions answered at in under 10 minutes. Go to now for free help!
  • anonymous
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. :)

Looking for something else?

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