Five years ago, I wrote a file search for a program called FixKey.  It searches a user’s hard drive for certain files.  I didn’t use recursion then for reasons that escape me at the moment.  The search went on for hours and with today’s terabyte drives, this type of search will not do.  So, back to recursions for me.  First thing I did was Google it, of course.  But everybody had this sample code to give:

try
{
 foreach (string d in Directory.GetDirectories(sDir))�
 {
  foreach (string f in Directory.GetFiles(d, txtFile.Text))
  {
   lstFilesFound.Items.Add(f);
  }
  DirSearch(d);
 }
}
catch (System.Exception excpt)
{
 Console.WriteLine(excpt.Message);
}

 First look and I already knew this will not work.  This does not even search the root.  Sure it will work for directory searches but file searches — maybe, I’m missing something.  It has some sort of reverse logic but somehow, this code has found its way into many forums and blogs. 

Here’s my code which is based on the code above but I tweaked it a little bit.

        public void getDirsFiles(DirectoryInfo d)
        {
            //create an array of files using FileInfo object
            FileInfo[] files;
            //get all files for the current directory
            try
            {
                files = d.GetFiles(txtFile.Text);
                foreach (FileInfo file in files)
                {
                    lstFilesFound.Items.Add(file.FullName);
                }
                DirectoryInfo[] dirs = d.GetDirectories("*.*");
                foreach (DirectoryInfo dir in dirs)
                {
                    getDirsFiles(dir);
                }
            }
            catch (Exception exc)
            {
            }        }

 Happy coding!