I wrote this C based program for my Data Structures Computer Science class this last fall as our last assignment. By far the most difficult program I’ve designed and coded to date and I’m very proud of it. At an overview of the program, you provide text files that have information about your music files. The text file is labeled something like “Depressing.plist” and every song in that file is in the “Depressing” genre. From there the program will match every song with the Boolean search you use. This can get extremely complicated, but a very basic example of ” 50 A Billy” would return a list of songs up to 50MB that are from an artist with the word “Billy” in it somewhere.

For those that aren’t comfortable using the Terminal, you won’t want to use this. However, for anyone else a little more technically inclined, you could very well use this program for its intended purpose. Basically, you have to provide a plain text file with a “.plist” extension ( I know this is reserved for preference files on Mac, but get over it – playlist is what it’s standing for here) that contains some basic info in a given order.

There is more information available in the PDF I’ve attached to this post, as it’s the same thing I had to write the program from. This program would be great for anyone interested in learning a bit more about data organization. The code is heavily documented showing how to use doubly-linked lists, red-black trees, hashing, and much more. And if you’re motivated, you could always read the program description and code one yourself, them compare with my code and executable. Sample input files are included.

Program description and prompt ( PDF )

Source Code (XCode Project)