Iterative algorithms are the rite of passage for the young mathematician programmers today. What with the flavor of Fibonacci sequence, prime factorization, GCD and LCM, and a bit of nondeterminism and just a smattering of ASCII, we have a hodgepodge of problems that may prove toughest yet. Will they realize that the tougher the problems are, the harder it is to make the long examination questions tough? They probably will never know...
Edit: Removed the ASCII portion to make the second bonus concern the nontermination of the program (redoing the operation) until a specific input is provided.
No comments:
Post a Comment