Well, I'll try to explain in laydude's terms. Say you have three files that were installed one after another; A, B and C. These files are stored in a big, empty space that we'll say is composed of "blocks". Let's also say each of these files take up 10 blocks, and those blocks are stored one after another; first file A's blocks, then file B's blocks, and so on. Now, after a little while, you decide you don't want file B on your hard drive anymore- you delete it, which frees up the blocks it was using. Then you install a new file, file D, which takes up 15 blocks. File D occupies those ten blocks that were previously freed up between A and C, but it needs five more blocks of space. The usual way to solve this problem is to put those five blocks after C, then "chain" the two parts of file D together. But the more this is done due to files being deleted-and subsequently, their space being filled by new files--, the more fragments have to be created, and the longer it takes to seek those files out. If they're all made to be in one neat space-via a program designed to "clean up"--, they'll be found quicker, which generally results in your computer running faster as a whole.
I am not an expert myself, and I did leave a lot out, so this isn't entirely true; it'll give you the proper gist, though.
One more thing. Everybody has their preferences on what program to use, but the best free one I've come across is
Auslogics Disk Defrag. It's very simple and very efficient! I recommend it highly.
e: Oh, one last thing, for realsies. This forum was not intended to offer personal tech support; don't expect regular help from me or anybody else, and please try searching for answers on your own next time. You'll find the internet contains vast information on the thing that allows people to access it efficiently.