I'm having some trouble understanding this piece of code that my professor used as example:
(define saved-cont #f)
(define (test-cont)
(let ((x 0))
(call/cc
(lambda (k)
(set! saved-cont k)))
(set! x (+ x 1))
(display x)
(newline)))
If we run for the first time (test-cont) what does k contain?
Note: I'm using R6RS Scheme.