Suggestion for the playlist sorting implementation
Posted: 24 Jul 2009 17:45
When having a list of multiple items with numbers in the filename, e.g. a tv show, meh[1x01] and meh[10x01] are listed right after each other with meh[2x01] as last item. This is called something sorting in programming, I can't remember what but I would love to see the sorting changed to natural sorting, if that is what it is called or at least make it an option. The result should be meh[1x01], meh[2x01], meh[10x01].
A fairly simple algorithm like:
if a < b then list item
else hold item until b < a
This is not a O(1) sorting, but close and since playlists should be under 10.000 items modern computers should handle it fine. Anyway this was just a thought I had when writing this post.
Thanks for the great work otherwise!
A fairly simple algorithm like:
if a < b then list item
else hold item until b < a
This is not a O(1) sorting, but close and since playlists should be under 10.000 items modern computers should handle it fine. Anyway this was just a thought I had when writing this post.
Thanks for the great work otherwise!