Do a trace of the following algorithm with n = 0, n = 2 and n...

  

Transcribed Image Text:

Do a trace of the following algorithm with n = 0, n = 2 and n = 4. What does the algorithm seem to be doing? Input: n Output: out Algorithm MYSTERY out 1; [n is a nonnegative integer] [out will be some integer (you have to figure out which one)] k0; repeat while k < n k+ k + 1; out-out-k; endrepeat Do a trace of the following algorithm with n = 0, n = 2 and n = 4. What does the algorithm seem to be doing? Input: n Output: out Algorithm MYSTERY out 1; [n is a nonnegative integer] [out will be some integer (you have to figure out which one)] k0; repeat while k < n k+ k + 1; out-out-k; endrepeat

Answer rating: 100% (QA)

The provided image shows a snippet of a document with an algorithm titled MYSTERY and a question abo... View the full answer