ÿX¤ÁÍA¤B¤T¤ÃØÂÄÓËÌÊE¤ €€€  *********************›** SORT3 **›*********************› + €;@,6€. (SHELL METZNER SORT›)##  ÓÈÅÌÌ ÍÅÔÚÎÅÒ ÓÏÒÔ*. . #THE INPUT OF THIS PROGRAM IS A LIST+++ #OF WORDS. THE OUTPUT IS THE LIST IN,** "ALPHABETICAL ORDER. WHEN INPUTTING--- %DATA DO NOT IMBED COMMAS WITHIN INPUT. WORDS. /((  THE SHELL SORT IS GENERALLY MORE0?< 4EFFICIENT THAN THE EASIER TO UNDERSTAND BUBBLE SORT.? 1@Ž;@,2 ENTER ANY CHARACTER TO BEGIN6Ž@+25 @P5 "INPUT NUMBER OF ITEMS TO BE SORTED< BF= @p= *INPUT MAXIMUM NUMBER OF LETTERS IN AN ITEMP‚ BZƒ;‚$,„;‚%@,…;‚,dINPUT ROUTINE›n x6†-‚ PLEASE INPUT ITEMSŒ‡-@‘  INPUT ITEM #‡–„  6ˆ-B:„,ªˆ‚A´88 0ITEM HAS MORE THAN THE MAXIMUM NUMBER OF LETTERS¾  INPUT AGAINÈ AEÒˆ"‚A€Ü6ƒ7†%@<†%ˆ,.„æ 6‰-†%ˆð%%6ƒ7‰%@<†%‚,.€7@<‚&ˆ,ú 6†-†%‚ ‡ A6ƒ7†%@<†%‚,.„" AP,SORTING ROUTINE›1 SORTING-SORTING-SORTING3    6 6Š-@6Š-P:Š'@,J$$TEST TO SE IF SORTING COMPLETE›TŠ @Ap^‹-@ŠhŒ-‹&ŠŠr 6-Œ|**6….ƒ7+Œ%Š&@,$‚%@<+Œ%Š,$‚,†,,…3ƒ7+&@,$‚%@<$‚,A0EE6ƒ7+%Š&@,$‚%@<+%Š,$‚,.ƒ7+&@,$‚%@<$‚,š 6-&Š¤@A®**6ƒ7+%Š&@,$‚%@<+%Š,$‚,.…¸ ŒÂ ‹Ì A ÖPRINTING ROUTINE›à‡-@ê"" ƒ7+‡&@,$‚%@<‡$‚,ô ‡þ€D:SORT3