Modern Sorting Sort

Home › Sorting › Sorting › Sort

Sort

Sorts an Array in ascending order in place; equal elements may change places.

Syntax

Sort( a )

Notes

• O(n log n) worst — in place, unstable

Examples

#import "std/containers"
using containers

dim v as Array( of int32 )
v.Push( 5 ) : v.Push( 1 ) : v.Push( 4 )

Sort( v )                    '' introsort, ascending, by T's own '<'
for i as int32 = 0 to v.Count - 1
    print v[ i ];
next
print                        '' 1 4 5

'' O(n log n) WORST case -- introsort switches to heapsort when the
'' recursion runs too deep, so the quicksort worst case cannot happen.
'' In place, no allocation, and NOT stable.

---

Library: Sorting
Category: Sorting
Documented under: Procedures