[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: Soundness of table.sort
- From: Roberto Ierusalimschy <roberto@...>
- Date: Wed, 4 Nov 2015 12:40:25 -0200
> > [...] and at least one  stable, in-place
> > comparison sort with worst-case time of O(n*log(n)) is now known,
> > which is however very complicated to program.
> Thank you for sharing this algorithm!
> Its implementation in C is about 1000 lines.
> $ wc -l ltablib.c
> 357 ltablib.c
That is the entire library. The 'sort' function takes ~100 lines.