Timeline for Optimal Solution for OddsBeforeEvens Wolfram Challenge
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22 at 3:30 | comment | added | Karl | @Navvye ~47.5, I don’t know exactly how the speedscore is derived, but the GroupBy one is slower than f1 on Wolfram Cloud(0.026 vs 0.36 for RandomInteger[10,10^6]) | |
| Feb 21 at 19:33 | comment | added | Navvye | could you submit your solution on Wolfram Challenges and see what the SpeedScore is? It's showing 37 for me, which is an order of magnitude less than other solutions.. Very weird!? | |
| Feb 21 at 8:03 | comment | added | Karl | @Navvye Updated. f1 is faster on lists ranging in length from 10 to 10^7. | |
| Feb 21 at 8:00 | history | edited | Karl | CC BY-SA 4.0 |
added 771 characters in body
|
| Feb 21 at 7:45 | comment | added | Navvye | Very interesting! I used the benchmark set by Wolfram Challenges, and the SpeedScore was ~47 compared to 51 and 52 respectively by the abovementioned solutions. I think that the performance of your solution is best when utilized on large lists, whereas something like my solution is better for smaller lists. What do you think? | |
| Feb 21 at 7:02 | comment | added | Karl | @Navvye Updated. | |
| Feb 21 at 7:00 | history | edited | Karl | CC BY-SA 4.0 |
added 558 characters in body
|
| Feb 21 at 6:49 | comment | added | Navvye |
Thanks! This is a unique solution, but it's not as fast as Join[Select[list, OddQ], Select[list, EvenQ]] or the most recent addition With[{split = GroupBy[list, OddQ]}, Join[split[True], split[False]]]
|
|
| Feb 21 at 6:38 | history | edited | Karl | CC BY-SA 4.0 |
added 66 characters in body
|
| Feb 21 at 6:04 | review | Low quality posts | |||
| Feb 21 at 6:10 | |||||
| Feb 21 at 5:48 | history | answered | Karl | CC BY-SA 4.0 |