How can "Lack of Order" in a list be measured?
The following questions gave me food for thought:
Efficient way to shuffle objects
I'd like to write an "ultimate shuffle" algorithm to sort my mp3 collection
When you sort a list - you always have a base-line(numbers, alphabet, ...) which tell you how to order the list.
Question: When you shuffle a set - how would you measure "lack of order"?
For example: 9 8 7 6 5 4 3 2 1 is ordered, even if completely differently than 1 2 3 4 5 6 7 8 9. And 9 8 7 6 1 2 3 4 5 also has some order (if you look at it in chunks: 9 8 7 6 and 1 2 3 4 5). Another example could be 9 2 3 4 5 6 7 8 1. How can you determine if one listing is less or more ordered than another.
The following questions gave me food for thought:
Efficient way to shuffle objects
I'd like to write an "ultimate shuffle" algorithm to sort my mp3 collection
When you sort a list - you always have a base-line(numbers, alphabet, ...) which tell you how to order the list.
Question: When you shuffle a set - how would you measure "lack of order"?
For example: 9 8 7 6 5 4 3 2 1 is ordered, even if completely differently than 1 2 3 4 5 6 7 8 9. And 9 8 7 6 1 2 3 4 5 also has some order (if you look at it in chunks: 9 8 7 6 and 1 2 3 4 5). Another example could be 9 2 3 4 5 6 7 8 1. How can you determine if one listing is less or more ordered than another.
No comments:
Post a Comment