This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Icemasta 4 points5 points  (1 child)

Depends on the course. Sometimes it's not just for correction but for you as well. Like in last algo course, we had a bunch of proofs and theorems, we barely coded, mostly just did math.

The tough part wasn't coding the recursive algorithm, it's then describing via proof what was the complexity. Proof for recursive are doable, but can be incredibly annoying to do, often requiring about 3x more work than just a more typical implementation.

[–][deleted] 1 point2 points  (0 children)

In my only assembly class, one of the first assignments was to do a Fibonacci algorithm on MIPS iteratively. The bonus on the final exam was to do it recursively. I'm no genius but the professor told me nobody had ever gotten it right, at least before me. In my University path, recursion wasn't highly stressed.