gdalgorithms-list

[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) 

Re: [Algorithms] Directory search without recursion?

[Patrick E. H. <hu...@tr...>]

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

So what's wrong with recursion?  Directory trees are a natural for this..

You could always build a local stack of directories in your current level,
then keep looping through that stack building further stacks, etc..
Basically recreating what a recursion would do anyways.

<question>
Where in heck did recursion get such a bad rap?
</question>