SortAlgorithm.js

// Generated by CoffeeScript 1.6.3
(function() {
  var SortAlgorithm, i, nums, sort;

  SortAlgorithm = (function() {
    function SortAlgorithm() {}

    SortAlgorithm.prototype.bubbleSort = function(nums) {
      var i, j, _i, _j, _nums, _ref, _ref1, _ref2, _ref3;
      _nums = nums.slice(0);
      for (i = _i = 0, _ref = _nums.length; 0 <= _ref ? _i <= _ref : _i >= _ref; i = 0 <= _ref ? ++_i : --_i) {
        for (j = _j = _ref1 = i + 1, _ref2 = _nums.length; _ref1 <= _ref2 ? _j <= _ref2 : _j >= _ref2; j = _ref1 <= _ref2 ? ++_j : --_j) {
          if (_nums[i] > _nums[j]) {
            _ref3 = [_nums[j], _nums[i]], _nums[i] = _ref3[0], _nums[j] = _ref3[1];
          }
        }
      }
      return _nums;
    };

    SortAlgorithm.prototype.quickSort = function(nums) {
      var i, left, pi, right, _i, _len, _nums, _ref;
      _nums = nums.slice(0);
      if (_nums.length < 1) {
        return _nums;
      }
      pi = _nums[0];
      left = [];
      right = [];
      _ref = _nums.slice(1);
      for (_i = 0, _len = _ref.length; _i < _len; _i++) {
        i = _ref[_i];
        if (i < pi) {
          left.push(i);
        } else {
          right.push(i);
        }
      }
      return this.quickSort(left).concat([pi]).concat(this.quickSort(right));
    };

    return SortAlgorithm;

  })();

  sort = new SortAlgorithm;

  nums = (function() {
    var _i, _results;
    _results = [];
    for (i = _i = 0; _i < 10; i = ++_i) {
      _results.push(Math.floor(Math.random() * 10));
    }
    return _results;
  })();

  console.log(sort.bubbleSort(nums));

  console.log(sort.quickSort(nums));

}).call(this);