Music sorting program - Developers

[img]http://saxservers.net/ace13/Sort.png[/img] Download: [url=http://saxservers.net/ace13/Music%20Sorter.rar]HERE[/url] I was unable to find a good free program to sort music for me so I wrote one myself, functions include: * Reading tags to get Artist / Album / Title * Fully recursive sorting (optional) * Loggging * TAG EDITING * Fully recursive tag editing * Only changing select values in tags * Batch Tag changing It only supports MP3s at the moment and I have no intention of fixing support for more formats as I never had the intention to release this Requires .NET Framework 3.5 [B]Update:[/B] Added several sort options and a simulate checkbox which will only create the folders and not copy any files Fixed a small bug where the program would refuse to sort if the source folder was written directly into the textbox [B]Update2:[/B] Fixed a bug where sorting without track numbers on songs that lack track numbers would remove part of the name [B]BIG Update:[/B] Added a tag editor [B]BIG Update2:[/B] Added the basics of a MP3 Merger/Joiner Added some misc stuff [B]Update3:[/B] Fixed some misc bugs and change logging system [B]Update4:[/B] Fixed even more misc bugs and added a custom sorting string

Feature suggestion: Add a "simulation" first, to show the user what the resulting folder structure will look like. (And obviously, more sorting options...)

Useful. You going to keep working on this?

What sorting method are you using? Assuming you are using proper sorts.

I'm not really sorting them as much as reading artist / album / genre / track number / title from the tags and then placing the file in a folder using those values (Update released)

Oh I see :). I thought you meant alphabetical sorting, which requires fast sorts etc.

Do you really need Framework 3.5, or did you just not change the project setting?

[QUOTE=nos217;15918170]Oh I see :). I thought you meant alphabetical sorting, which requires fast sorts etc.[/QUOTE] [img]http://www.roseindia.net/java/beginners/arrayexamples/insertion.gif[/img] [b]you are now offended[/b] if you don't get the joke [sp]insertion sorts are particularly slow compared to merge sorts and other algorithms[/sp]

[QUOTE=gparent;15919124]Do you really need Framework 3.5, or did you just not change the project setting?[/QUOTE] As I said, I never intended to release it ;)

[QUOTE=HubmaN V2;15919548][img]http://www.roseindia.net/java/beginners/arrayexamples/insertion.gif[/img] [b]you are now offended[/b][/QUOTE] You can't do that. You can't just look at a number and say: "Hey, that's the second lowest therefore it goes second from the left." You can only compare two data members at a time, and you can't just make it "know" which number it would be from the left. [editline]06:48PM[/editline] Do you know anything about sorts? :D

[QUOTE=nos217;15922841]Do you know anything about sorts? :D[/QUOTE] [url=http://www.roseindia.net/java/beginners/arrayexamples/InsertionSort.shtml]Much more than you do, apparently.[/url]

Well, I think he was referring to a missing second arrow which checks what previous element is smaller than the current one (the one the blue arrow points at).

Right, but that diagram is still accurate to show what happens after each iteration.

Actually, on the 3rd to 2nd last step, it throws 3 into the second position, which a sort can't do (I believe). It would have to leave it where it is and go through the process again. [media]http://www.youtube.com/watch?v=F3oKjPT5Khg[/media]

It's just showing the stages after each pass but I don't know what relevence it has apart from 'look I know what a sort is'

No, I'm defending my point.

You can do that. You could even just randomly re-arrange the elements, check if it's sorted and if not, repeat (see Bogosort).

Yeah you're right, but can a sort actually do what it does in that step on that image? I didn't believe so, as how would the computer know that it's the second lowest without comparing it to all of the other values too? It can't. And that doesn't fit with the style of the sort in that picture. It looks to me like it is comparing the focused number with the current lowest, and if it is lower, makes it the new lowest number. But then suddenly in the second last step the number is put into the second position, when it should have stayed where it was since only 2 pieces of data can be compared at a time. I could be completely wrong, and if I am please explain. I like learning more.

As I said, a second arrow would be useful to explain the sort-algorithm. But this picture does not explain the algorithm, but rather is showing the progress after each iteration. It's Insertionsort btw.

Ohh I see. They just didn't display all of the steps.

Any more suggestions for stuff to add?

It would be cool if it had an ID3 editor too. That would be cool.

Done and Done, am I cool or what :c00l:

Nice one! :D. [editline]09:51PM[/editline] Hmm, what else... you could change the Album Art. If that's possible.

Another addition, although a not too functional one (length is reported incorrectly most of the time)

Updated once more, tell me if I should add anything more to it.

Nice a merger sounds cool :). I cant see a need for it, but useful nonetheless.