Hi,

This is an implementation of the "Insertion sort" algorithm. I find that it is reasonable fast and easy to program. This is my first try, but here it is for your consideration, though. It assumes that the numbers list begins always in register 0 and 10 items as the learning module, but it can be modified easily to follow Gene's requirements. I run it against the bubble program and it completed sorting in half the time or less. It was just fun to do it.

I001 LBL I

I002 1.009

I003 STO K

I004 RCL K

I005 STO I

I006 RCL (I)

I007 RCL I

I008 IP

I009 STO J

I010 x=0?

I011 GTO I022

I012 1

I013 -

I014 STO I

I015 x<>y

I016 RCL (I)

I017 x<=y?

I018 GTO I022

I019 STO (J)

I020 x<>I

I021 GTO I009

I022 x<>y

I023 STO (J)

I024 ISG K

I025 GTO I004

I026 RTNLN=84

CK=AD7D

Regards,

Miguel