
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


Sort an array of numbers (of any convenient size) into ascending order using   Patience sorting.



Related task

   Longest increasing subsequence


PatienceSort(A){
    P:=0, Pile:=[], Result:=[]
    for k, v in A
    {
        Pushed := 0
        loop % P 
        {
            i := A_Index
            if Pile[i].Count() && (Pile[i, 1] >= v)
            {
                Pile[i].InsertAt(1, v)
                pushed := true
                break
            }
        }
        if Pushed
            continue
        P++
        Pile[p] := []
        Pile[p].InsertAt(1, v)
    }
 
    ; optional to show steps ;;;;;;;;;;;;;;;;;;;;;;;
    loop % P 
    {
        i := A_Index, step := ""
        for k, v in Pile[i]
            step .= v ", "
        step := "Pile" i " = "  Trim(step, ", ")
        steps .= step "`n"
    }
    MsgBox % steps
    ; end optional ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
 
    loop % A.Count()
    {
        Collect:=[]
        loop % P
            if Pile[A_index].Count()
                Collect.Push(Pile[A_index, 1])
 
        for k, v in Collect
            if k=1
                m := v
            else if (v < m)
            {
                m := v
                break
            }
 
        Result.push(m)
        loop % P
            if (m = Pile[A_index, 1])
            {
                Pile[A_index].RemoveAt(1)
                break
            }
    }
    return Result
}