code golfing algorithms, with readability in mind.

minimalgorithms.js

const qsort = ([first, ...rest]) => 
  first === undefined 
    ? [] 
    : [
        ...qsort([for (x of rest) if (x < first) x]),
        first,
        ...qsort([for (x of rest) if (x >= first) x])
      ]

resources.md

#qsort

Quicksort using es6 features:

• parameter destructuring with rest operator
• array comprehension and spreading

##Sources http://rosettacode.org/wiki/Quicksort#Python

http://raganwald.com/2015/02/02/destructuring.html