
Sorting Algorithm

This is a sorting algorithm.   It may be applied to a set of data in order to sort it.    
For comparing various sorts, see compare sorts.  
For other sorting algorithms,   see sorting algorithms,   or:

O(n logn) sorts
Heap sort |
Merge sort |
Patience sort |
Quick sort
O(n log2n) sorts
Shell Sort
O(n2) sorts
Bubble sort |
Cocktail sort |
Cocktail sort with shifting bounds |
Comb sort |
Cycle sort |
Gnome sort |
Insertion sort |
Selection sort |
Strand sort
other sorts
Bead sort |
Bogo sort |
Common sorted list |
Composite structures sort |
Custom comparator sort |
Counting sort |
Disjoint sublist sort |
External sort |
Jort sort |
Lexicographical sort |
Natural sorting |
Order by pair comparisons |
Order disjoint list items |
Order two numerical lists |
Object identifier (OID) sort |
Pancake sort |
Quickselect |
Permutation sort |
Radix sort |
Ranking methods |
Remove duplicate elements |
Sleep sort |
Stooge sort |
[Sort letters of a string] |
Three variable sort |
Topological sort |
Tree sort


Task

Given an integer   n,   return   1──►n   (inclusive)   in lexicographical order.



Show all output here on this page.



Example

Given   13,

return:   [1,10,11,12,13,2,3,4,5,6,7,8,9].

function leq( n as integer, m as integer ) as boolean
    if str(n)<=str(m) then return true else return false
end function
 
sub shellsort(s() as integer)
    dim as integer n = ubound(s)
    dim as integer i, inc = n
    dim as boolean done
 
    do
        inc\=2.2
        if inc = 0 then inc = 1
        do
            done = false
            for i = 0 to n - inc
                if leq(s(i+inc), s(i)) then
                    swap s(i), s(i + inc)
                    done = true
                end if
            next
        loop until done = 0
    loop until inc = 1
end sub
 
dim as integer n, i
 
input n
 
dim as integer s(0 to n-1)
for i = 0 to n-1
    s(i) = i+1
next i
 
shellsort(s())
 
print "[";
for i = 0 to n-1
    print s(i);
    if i<n-1 then print ", ";
next i
print "]"