Related sites: | site map |

# aiju.de Home of aiju

- › about me/
- › b/
- » code/
- - › RatJS
  - › homework/
  - » k/
  - - › cluster
    - › coins
    - › eratothenes
    - › euler phi
    - › feigenbaum
    - › fibonacci
    - › fsm
    - › molecule
    - › pascal
    - » qsort
    - › sierpinski
    - › tictactoe
  - › misc/
  - › pdp11/
- › donate
- › electronics/
- › legal
- › misc/
- › plan 9/

# Quicksort

    qsort:{:[#x;(qsort x@&x[0]>/:x),x[0],(qsort x@&x[0]</:x);()]}
    qsort:{:[#x;(qsort x@&x[0]>/:x),(x@&x[0]=/:x),(qsort x@&x[0]</:x);()]}

The former variant removes duplicates while the latter preserves them.