Fortune Linuxando
_ _ _ _ _ _ _ _ _ _ _ _ _
The algorithm for finding the longest path in a graph is NP-complete. For you systems people, that means it's *real slow*. -Bart Miller
^__^ (xx)\_______ (__)\ )\/\ U ||----w | || ||
find -type f -size 0