Just about every chess search function such as
minimax is recursive.
matrix multiplication algorithms such as straussens
are recursive
http://cs.engr.uky.edu/~lewis/essays.../Strassen.html
merge sort and quick sort are recursive.
Alot of this you would maybe design your algorithm recursively
then if there's a possible speedup you would do it
iteratively.
