// Memoized recursion. A FUNCTION cannot take BYREF, so the memo table has to travel through a PROCEDURE // with the answer coming back BYREF too. Finding: this is the idiom; it reads heavier than in most languages. // EXPECT: 6765 // EXPECT: 12586269025 PROCEDURE FIB(N : INTEGER, BYREF Memo : HASHMAP OF INTEGER : INTEGER, BYREF Result : INTEGER) IF N < 2 THEN Result <- N RETURN ENDIF IF N IN Memo THEN Result <- Memo[N] RETURN ENDIF DECLARE A, B : INTEGER CALL FIB(N - 1, Memo, A) CALL FIB(N - 2, Memo, B) Memo[N] <- A + B Result <- A + B ENDPROCEDURE DECLARE M : HASHMAP OF INTEGER : INTEGER DECLARE R : INTEGER CALL FIB(20, M, R) OUTPUT R CALL FIB(50, M, R) OUTPUT R