Fisher-Yates is a better idea, of course, since it is pretty short and runs in linear time, but if someone insists on a sort-based one-linear this should work:
list.map(function (t) { return [Math.random(), t]; }).sort().map(function (t) { return t[1]; })