Sort numbers lexicographically

From Rosetta Code
Revision as of 14:02, 25 July 2018 by CalmoSoft (talk | contribs) (Created page with "Given an integer n, return 1 - n in lexicographical order. <br> For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9]. <br> <br> =={{header|Ring}}== {{draft task}} <l...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Given an integer n, return 1 - n in lexicographical order.
For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].

Ring

Sort numbers lexicographically is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

<lang ring>

  1. Project : Lexicographical numbers
  2. Date  : 2018/07/25
  3. Author : Gal Zsolt (~ CalmoSoft ~)
  4. Email  : <calmosoft@gmail.com>

lex = 1:13 strlex = list(len(lex)) for n = 1 to len(lex)

    strlex[n] = string(lex[n])

next strlex = sort(strlex) see "Lexicographical numbers = " showarray(strlex)

func showarray(vect)

       see "["
       svect = ""
       for n = 1 to len(vect)
             svect = svect + vect[n] + ","
       next
       svect = left(svect, len(svect) - 1)
       see svect + "]" + nl

</lang> Output:

Lexicographical numbers = [1,10,11,12,13,2,3,4,5,6,7,8,9]