[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: Length-unaware sorting algorithm
- From: Tim Hume <tim@...>
- Date: Fri, 26 Aug 2016 09:19:03 +1000 (AEST)
Well I guess you could just grab data as they arrive and keep on inserting
them into the correct position in a growing list of sorted data you've
already received? It might not be very efficient though.
On Thu, 25 Aug 2016, Soni L. wrote:
Have y'all noticed how pretty much all sorting algorithms rely on length?
Are there any sorting algorithms that aren't explicitly aware of the
sequence/array length, and instead just happen to produce a sorted array?
(i.e. a sorting algorithm that doesn't rely on # or manual length
calculations, and doesn't explicitly try to find the boundary where the array
Even the current Lua sorting algorithm uses the table length. Would be
interesting if there was a sorting algorithm about as fast as Lua's current
sorting algorithm, but without relying on length.