Re: lhs and rhs in table.sort

[Date Prev][Date Next][Thread Prev][Thread Next] [Date Index] [Thread Index]

• Subject: Re: lhs and rhs in table.sort
• From: Dirk Laurie <dirk.laurie@...>
• Date: 2015年8月27日 21:49:10 +0200

---

2015年08月27日 17:55 GMT+02:00 Coda Highland <chighland@gmail.com>:
> I'm not sure about heap sort.
Heap sort has best case, average case, worst case, all O(n log n),
only the multipliers differ. Auxiliary storage O(1). See Nijenhuis and
Wilf's book, available online [1].
[1] http://www.math.upenn.edu/%7Ewilf/website/CombAlgDownld.html

---

• Follow-Ups:
  • Re: lhs and rhs in table.sort, Coda Highland

• References:
  • Re: lhs and rhs in table.sort, iain morland
  • Re: lhs and rhs in table.sort, Tim Hill
  • Re: lhs and rhs in table.sort, Dirk Laurie
  • Re: lhs and rhs in table.sort, Coda Highland

• Prev by Date: Re: lhs and rhs in table.sort
• Next by Date: Re: lhs and rhs in table.sort
• Previous by thread: Re: lhs and rhs in table.sort
• Next by thread: Re: lhs and rhs in table.sort
• Index(es):
  • Date
  • Thread