[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: Re: Length-unaware sorting algorithm
- From: Coda Highland <chighland@...>
- Date: Thu, 25 Aug 2016 20:58:05 -0700
On Thu, Aug 25, 2016 at 4:53 PM, Phil Bewig <pbewig@gmail.com> wrote:
> Heapsort, which I described above, doesn't need to know the length in
> advance.
I believe the technicality is that it still has to have some notion of
a stopping point before you can start taking elements out if you
expect them to be in order.
/s/ Adam
