Timeline for Algorithm to order array
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2014 at 21:30 | vote | accept | Dusan | ||
| Mar 5, 2014 at 21:37 | answer | added | U2EF1 | timeline score: 1 | |
| Mar 5, 2014 at 19:36 | review | Close votes | |||
| Mar 10, 2014 at 2:10 | |||||
| Mar 5, 2014 at 19:26 | comment | added | user53019 | @Dusan - with 57 views on your question, you have no idea who has up voted or down voted. Voting on SE is intentionally anonymous by design. I doubt gnat wasted a down vote on your question, but your response merely encourages others to downvote and then not leave a comment explaining why. | |
| Mar 5, 2014 at 17:38 | answer | added | Doc Brown | timeline score: 4 | |
| Mar 5, 2014 at 17:33 | history | edited | Dusan | CC BY-SA 3.0 |
deleted 1 characters in body; edited title
|
| Mar 5, 2014 at 17:24 | comment | added | user40980 | @Dusan you may be interested in I'd like to write an “ultimate shuffle” algorithm to sort my mp3 collection which specifically addresses the DJ problem. | |
| Mar 5, 2014 at 17:18 | comment | added | Dusan | @delnan yes it is a business requirement. Take for example a DJ which needs to play song A 10 times, song B 5 times and song C 7 times, ... but he needs an algorithm to make order of songs in such way that no same song is played twice in a row (if possible). | |
| Mar 5, 2014 at 17:15 | comment | added | Dusan | I am reading about that algorithm, but it seems it is just a plain random shuffler, does not minimize the same adjacent elements. | |
| Mar 5, 2014 at 17:15 | comment | added | user7043 | You apparently care a lot about the shuffle not being random (or at least, not randomly chosen from all permutations but only from those fulfilling a specific criteria). Is that an actual business requirement, or are you just scared of random numbers? ;-) | |
| Mar 5, 2014 at 17:09 | history | asked | Dusan | CC BY-SA 3.0 |