Actually, I change my original answer. After studying the alogigrithm and my implementation and use (as well as taking your advice and running top), my resources get clobbered. After I get up around 3000K of free memory or so, the process get killed. I'll probably just need to reimplement the algorithm in an iterative fashion...hey this can be my new question to your gurus. How can I reimplement merlyn's algorithm that I link above in an iterative fashion? :)

Thanks, Bamafan