more doc fixes.

Author: JakeHP

src/graphics/bresenham-line-drawing.js

@@ -8,6 +8,7 @@
    * @param  {number} y1 The second coordinate of the beginning of the line
    * @param  {number} x2 The first coordinate of the end of the line
    * @param  {number} y2 The second coordinate of the end of the line
+   * @param  {function} draw Optional custom drawing function.
    */
   function drawLine(x1, y1, x2, y2, draw) {
     drawPoint = draw || drawPoint;

src/graphs/shortest-path/dijkstra.js

@@ -39,6 +39,7 @@
      *
      * @private
      * @param {number} src Start node.
+     * @param {Array} graph A distance matrix of the graph.
      */
     function init(src, graph) {
       var currentTemp;

src/graphs/shortest-path/floyd-warshall.js

@@ -12,8 +12,8 @@
      * Initialize the distance matrix.
      *
      * @private
-     * @param {array} graph Distance matrix of the array.
-     * @return {array} Distance matrix used for the algorithm.
+     * @param {Array} graph Distance matrix of the array.
+     * @return {Array} Distance matrix used for the algorithm.
      */
     function init(graph) {
       var dist = [];

src/others/hanoi.js

@@ -25,8 +25,8 @@
    *
    * @param {Number} count Count of the plates/stones.
    * @param {String|Number} source Identifier of the 1st peg.
-   * @param {String|Number} source Identifier of the 2nd peg.
-   * @param {String|Number} source Identifier of the 3rd peg.
+   * @param {String|Number} intermediate Identifier of the 2nd peg.
+   * @param {String|Number} goal Identifier of the 3rd peg.
    * @return Array which contains all the moves required
    * in order to place all the plates onto the last peg.
    */

src/searching/quickselect.js

@@ -18,7 +18,7 @@
    * @param {Array} arr Input array.
    * @param {Number} n A number of an element.
    * @param {Number} lo Low index.
-   * @param {Number} lo High index.
+   * @param {Number} hi High index.
    * @return Returns n-th smallest element.
    */
   function quickselect(arr, n, lo, hi) {

src/searching/recursive-binarysearch.js

@@ -26,7 +26,7 @@
 
     /**
      * Recursive version of binary search.
-     * Searchs for specific element in a given array using
+     * Searches for specific element in a given array using
      * the binary search algorithm.<br><br>
      * Time complexity: O(log N).
      *