
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].

 
#!/bin/ksh
 
# Sort numbers lexicographically
 
#	# Variables:
#
integer N=${1:-13}
 
#	# Functions:
#
 
#	# Function _fillarray(arr, N) - fill assoc. array 1 -> N
#
function _fillarray {
	typeset _arr ; nameref _arr="$1"
	typeset _N ; integer _N=$2
	typeset _i _st _en ; integer _i _st _en
 
	(( ! _N )) && _arr=0 && return
	(( _N<0 )) && _st=${_N} && _en=1
	(( _N>0 )) && _st=1 && _en=${_N}
 
	for ((_i=_st; _i<=_en; _i++)); do
		_arr[${_i}]=${_i}
	done
}
 
 ######
# main #
 ######
 
set -a -s -A arr
typeset -A arr
_fillarray arr ${N}
 
print -- ${arr[*]}