News for hackers. Stuff that matters.
Re:Timsort is a sorting algorithm that is efficient for real... by senatorobama on Sunday July 01, 2018 @08:23PM (#17438526)
Any sorting algorithms that use deep learning?
Re:Timsort is a sorting algorithm that is efficient for real... by KMag on Monday July 02, 2018 @01:21AM (#17439494)
You could of course write one. Presumably you're talking about using deep learning to decide the order in which to compare elements, but this would be difficult to ensure both always terminated and always gave correct results, to say nothing of likely being very inefficient.

The difficulties in sorting algorithms aren't difficulties in recognizing patterns, so it's difficult to see what deep learning brings to the table.

That being said, knock yourself out; surprise me!

Re:Timsort is a sorting algorithm that is efficient for real... by neolefty on Monday July 02, 2018 @09:43AM (#17441523)
For creating custom comparators?

"Sort these web pages in order of quality."

Re:Timsort is a sorting algorithm that is efficient for real... by KMag on Monday July 02, 2018 @03:24PM (#17444625)
I've never seen a reference text that considers the comparator part of the sorting algorithm.

Timsort, quicksort, mergesort, introsort, smoothsort, etc. don't include the comparator as part of the algorithm definition.

Re:Timsort is a sorting algorithm that is efficient for real... by jogjayr on Tuesday July 03, 2018 @12:02AM (#17447424)
You mean like a search engine? :-)

I believe ML is used in search engines nowadays.

Re:Timsort is a sorting algorithm that is efficient for real... by pouta on Monday July 02, 2018 @01:56AM (#17439586)
Maybe finding in the input data.
Re:Timsort is a sorting algorithm that is efficient for real... by KMag on Monday July 02, 2018 @02:32AM (#17439698)
"Finding" what in the input data as a part of sorting?
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 ;-)
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 ;)