Remove return; change functional to declarative

mik-laj · mik-laj · commit 07903651a9ee · 2017-06-07T19:11:22.000+02:00
diff --git a/src/sorting/quicksort-declarative.js b/src/sorting/quicksort-declarative.js
@@ -7,7 +7,7 @@
   }
 
   /**
-   * Quicksort algorithm (functional variant)
+   * Quicksort algorithm (declarative variant)
    *
    * @public
    * @param {array} array Array which should be sorted.
@@ -21,7 +21,7 @@
      * @private
      * @param {array} array Array which should be processed
      */
-    return function quickSort(array, cmp) {
+    function quickSort(array, cmp) {
       if (array.length < 1) {
         return arr;
       }
@@ -38,17 +38,17 @@
 
     /**
      * Quicksort algorithm. In this version of quicksort used
-     * functional programming mechanisms.<br><br>
+     * declarative programming mechanisms.<br><br>
      * Time complexity: O(N log(N)).
      *
      * @example
      *
      * var sort = require('path-to-algorithms/src' +
-     * '/sorting/quicksort-functional').quickSort;
+     * '/sorting/quicksort-declarative').quickSort;
      * console.log(sort([2, 5, 1, 0, 4])); // [ 0, 1, 2, 4, 5 ]
      *
      * @public
-     * @module sorting/quicksort-functional
+     * @module sorting/quicksort-declarative
      * @param {Array} array Input array.
      * @param {Function} cmp Optional. A function that defines an
      * alternative sort order. The function should return a negative,
diff --git a/test/sorting/quicksort-declarative.spec.js b/test/sorting/quicksort-declarative.spec.js
@@ -1,5 +1,5 @@
 var sortTestCase = require('./sort.testcase.js');
 var quickSort =
-      require('../../src/sorting/quicksort-functional.js').quickSort;
+      require('../../src/sorting/quicksort-declarative.js').quickSort;
 
 sortTestCase(quickSort, 'Quick sort');
