We're on Discord! Please join our server now if you don't want to miss anything! (More info) | Join the UCC4 contest! (More info)

* WalrusIRC

You need to have 5 posts and not be part of restricted usergroups in order to use the WalrusIRC embedded shoutbox. However, you can also access our IRC channel called #CodeWalrus via EFnet.

Author Topic: Heapsort, VATSort, and ListSort  (Read 180 times)

0 Members and 1 Guest are viewing this topic.

Offline Lionel Debroux

  • Full User
  • Join Date: Jan 2015
  • Location:
  • Posts: 240
  • Post Rating Ratio: +11/-0
    • debrouxl
    • 58/5891
Re: Heapsort, VATSort, and ListSort
« on: July 04, 2018, 04:48:26 am »
Hi Zeda :)
That's another great display that TI uses silly, slow algorithms...
That reminds me of Samuel Stearley's faster next_expression_index() and list item access routines for the TI-68k series.

Out of curiosity:
* how much execution time does inlining the comparison function save ?
* what's the execution time of an implementation of shellsort with a reasonable sequence (not the original O(n^2) one) on the same-sized lists produced from the same random seeds ? There's no O(n*log(n)) implementation of shellsort, but there's usually a range of sizes where an implementation with a reasonable sequence it trounces the quadratic sorts while being competitive with some asymptotically better O(n*log(n)) sorts. 200 items could be within that range, but 999 usually isn't.
Member of the TI-Chess Team.
Co-maintainer of GCC4TI (GCC4TI online documentation), TIEmu and TILP.
Co-admin of TI-Planet.

 


You can also use the following HTML or bulletin board code to share it on your page or forum signature!


Also do not forget to check our affiliates below.
Planet Casio TI-Planet Calc.news BroniesQC BosaikNet Velocity Games