[Algorithms] Directory search without recursion?

[J M. <jmo...@bi...>]

First, an introduction.
Name is Jesse M Moore, and programming (as a hobby) since Turbo Pascal 1.0.

now the question:
Writing a program that searches for a file on disk. I need search to sub 
folders.

Typically the algorithm is like this: (in pseudo-pascal code)

procedure Search

  procedure nextdir;

  begin
   FindFirst;
   repeat
    if (searchrec yields a subdirectory) then NextDir;
   until FindNext=0;
   FindClose;
  end;
..

is there any way to implement this without recursion?
any opinions on using recursion for anything?

thanks (and trying not to be a lurker)