I like to use naive recursive fibonacci to bootstrap performance testing of my interpreters. It's a pretty lousy algorithm, but it does a good job of stress tes

I like to use naive recursive fibonacci to bootstrap performance testing of my interpreters. It's a pretty lousy algorithm, but it does a good job of stress testing instruction dispatch and function calls.