Add the partitioning function's names

mgechev · mgechev · commit a8ce3592b66e · 2015-01-25T18:35:54.000+02:00
diff --git a/src/sorting/quicksort-middle.js b/src/sorting/quicksort-middle.js
@@ -19,6 +19,7 @@
      * Partitions the array in two parts by the middle elements.
      * All elemnts which are less than the chosen one goes left from it
      * all which are greater goes right from it.
+     * Uses Hoare's partitioning algorithm.
      *
      * @param {array} array Array which should be partitioned
      * @param {number} left Left part of the array
diff --git a/src/sorting/quicksort.js b/src/sorting/quicksort.js
@@ -14,7 +14,7 @@
     }
 
     /**
-     * Partitions given subarray.
+     * Partitions given subarray using Lomuto's partitioning algorithm.
      *
      * @private
      * @param {array} array Input array

Original file line number	Diff line number	Diff line change
`@@ -19,6 +19,7 @@`
`19`	`19`	`* Partitions the array in two parts by the middle elements.`
`20`	`20`	`* All elemnts which are less than the chosen one goes left from it`
`21`	`21`	`* all which are greater goes right from it.`
	`22`	`+ * Uses Hoare's partitioning algorithm.`
`22`	`23`	`*`
`23`	`24`	`* @param {array} array Array which should be partitioned`
`24`	`25`	`* @param {number} left Left part of the array`
Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@`
`14`	`14`	`}`
`15`	`15`
`16`	`16`	`/**`
`17`		`- * Partitions given subarray.`
	`17`	`+ * Partitions given subarray using Lomuto's partitioning algorithm.`
`18`	`18`	`*`
`19`	`19`	`* @private`
`20`	`20`	`* @param {array} array Input array`