What you are wanting to do is a recursive function that sorts within each word. If the first character is all you care about, it would be easy enought to code, but if *every* character comes into play, the problem becomes grossly complex. This isn't a sort problem. It's a filing order problem.
Bob S > On May 18, 2017, at 14:15 , Bob Sneidar <bobsnei...@iotecdigital.com> wrote: > > Then that is not a sort! > > Bob S > > >> On May 18, 2017, at 14:13 , Kaveh Bazargan via use-livecode >> <use-livecode@lists.runrev.com> wrote: >> >> Thanks Phil >> >> That works in the case I mentioned, but with different letters, All upper >> case chars come to top, so I get: >> >> Goodbye >> Hello >> goodbye >> hello >> >> What I need is >> >> Goodbye >> goodbye >> Hello >> hello >> >> >> On 18 May 2017 at 18:19, Phil Davis via use-livecode < > _______________________________________________ use-livecode mailing list use-livecode@lists.runrev.com Please visit this url to subscribe, unsubscribe and manage your subscription preferences: http://lists.runrev.com/mailman/listinfo/use-livecode