.log('sorting took ' + profilingZoneSpec.time() + ' of CPU time');
    });
  }


  /*
   * This is a really efficient algorithm.
   *
   * First, check if the array is sorted.
   * - If it is, call the wrapCallback
   * - If it isn't, randomize the array and recur
   *
   * This implementation is async because JavaScript
   */
  function asyncBogosort (arr, cb) {
    setTimeout(function () {
      if (isSorted(arr)) {
        cb(arr);
      } else {
        var newArr = arr.slice(0);
        newArr.sort(fun