Question

Already been answer on the website, but I didn't understand the answer. I would appreciate a better explanation, thank you:

Consider an algorithm in Java for determining the size of some nested folders/files recursively. (Imagine right clicking an item on your desktop and viewing it's size.) What would be the base case(s) for this problem?

Answer 1

Code :

public static long folderSize(File directory)
{
     long length = 0;
     for (File file : directory.listFiles())
     {
          if (file.isFile())
               length += file.length();
          else
               length += folderSize(file);
     }
     return length;
}

Algorithm :

• Check the lists of files by using for (File file : directory.listFiles()).
• Then check if the file if present by using if (file.isFile()).
• If it returns true add the length of this file to final length,
• Else the current item is a folder and hence recursively check for the sub folders/files of the current folder.

Here the base case if when the current folder is empty or when all the files/folders have been examined of the current folder.

******************NOTE******************

If there is any problem with the code.. or If you have some doubts... please ask in the comments. :)
If everything is good, please rate positively ... as it directly affects our payscale :)

P.S. If you need the explanation of the code answered to you in your question, please provide the code or the screenshot of the code.