
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


  [ dip [ 0 over size rot ]
    nested bsearchwith
      [ -1 peek
        dip [ -1 peek ] > ]
    drop ]                       is searchpiles ( [ n --> n )
 
  [ dup size dup 1 = iff
    [ drop 0 peek ] done
    2 / split
    recurse swap recurse
    merge ]                      is k-merge     (   [ --> [ )
 
  [ 1 split dip nested
    witheach
      [ 2dup dip dup
        searchpiles
        over size over = iff
          [ 2drop
            nested nested join ]
        else
          [ dup dip
              [ peek swap join
                swap ]
            poke ] ]
    k-merge ]                    is patience-sort ( [ --> [ )
 
 
  ' [ 0 1 2 3 4 5 6 7 8 9 ]
  shuffle dup echo cr 
  patience-sort echo