Abstract: Recurrence has useful theoretical value for its simplicity, intelligibility, readability andrealizability. But it involves so many useful and useless data to be saved in recursive procedure sothat it exhausts all the memory resources when it gets into a certain layer. For this reason, recurrence is seldom used in real application and its practicality is not satisfactory. It will be of greatsignificance to find out a new type recurrence algorithm that keeps advantages of simplicity, intelligibility, readability and realizability on one side and avoids ti,p disadvantage of exhausting a lotof memory resources on the other.This paper describes how to realize recurrence algorithm by using a non--recurrence strategysuch as a two-way chain-list.