Re:Timsort is a sorting algorithm that is efficient for real...
by dmichulke on Monday July 02, 2018 @04:26AM
(#17440091)
You could always just write out all permutations and train a network on recognizing the sorted one ;-)
[ Parent
| on HN ]
Re:Timsort is a sorting algorithm that is efficient for real...
by Sohcahtoa82 on Monday July 02, 2018 @04:09PM
(#17444928)
A storage requirement of O(n!)
Sorting a mere 13 items of 1-byte each would require 6.2 GB of storage.
Re:Timsort is a sorting algorithm that is efficient for real...
by dmichulke on Wednesday July 04, 2018 @05:05AM
(#17456097)
We just generate them on the fly - after all we're not stupid ;-)
https://en.wikipedia.org/wiki/Permutation#Algorithms_to_gene...
.. and there
"Generation in lexicographic order"
This algorithm only requires you to hold the last permutation in memory to obtain a new (distinct) one.
Re:Timsort is a sorting algorithm that is efficient for real...
by senatorobama on Tuesday July 03, 2018 @03:33AM
(#17448228)
Good interview question ;)