5 ms·
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 difficul
by KMag 8y ago
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!
- pouta 8y agoMaybe finding in the input data.
- KMag 8y ago"Finding" what in the input data as a part of sorting?
- neolefty 8y agoFor creating custom comparators? "Sort these web pages in order of quality."
- KMag 8y agoI'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.
- jogjayr 8y agoYou mean like a search engine? :-) I believe ML is used in search engines nowadays.