Rename longest-subsequence to longest-increasing-subsequence.

krzysztof-grzybek · krzysztof-grzybek · commit c5486fcae517 · 2016-12-15T20:47:08.000+01:00
diff --git a/src/searching/longest-increasing-subsequence.js b/src/searching/longest-increasing-subsequence.js
@@ -1,7 +1,7 @@
 (function (exports) {
   'use strict';
 
-  exports.longestSubsequence = (function () {
+  exports.longestIncreasingSubsequence = (function () {
 
     /**
     * Find the index of the first largest element in array.
@@ -57,12 +57,12 @@
     }
 
     /**
-    * Finds the longest sub-sequence for given node.<br><br>
+    * Finds the longest increasing sub-sequence for given node.<br><br>
     * Complexity: O(N^N).
     * @private
     * @param {Object} dag  Graph represented with list of neighbours.
     * @param {number} node The current node.
-    * @return {object} The longest sub-sequence for given node.
+    * @return {object} The longest increasing sub-sequence for given node.
     */
     function find(dag, node) {
       node = node || 0;
@@ -103,7 +103,7 @@
     *
     * @example
     * var subsequence = require('path-to-algorithms/src/searching/'+
-    * 'longest-increasing-subsequence').longestSubsequence;
+    * 'longest-increasing-subsequence').longestIncreasingSubsequence;
     * console.log(subsequence([1, 0, 4, 3, 5])); // 1, 4, 5
     *
     * @public
diff --git a/test/searching/longest-increasing-subsequence.spec.js b/test/searching/longest-increasing-subsequence.spec.js
@@ -1,36 +1,36 @@
 'use strict';
 
-var longestSubsequence =
+var longestIncreasingSubsequence =
   require('../../src/searching/' +
-    'longest-subsequence')
-    .longestSubsequence;
+    'longest-increasing-subsequence')
+    .longestIncreasingSubsequence;
 
-describe('longest subsequence', function () {
+describe('longest increasing subsequence', function () {
 
   var sequence;
   beforeEach(function () {
     sequence = [5, 2, 8, 6, 3, 6, 9, 7, 11];
   });
 
   it('should work with empty array', function () {
-    expect(longestSubsequence([]).length).toBe(0);
+    expect(longestIncreasingSubsequence([]).length).toBe(0);
   });
 
   it('should return the only element in a single element array', function () {
     var array = [1];
-    expect(longestSubsequence(array)).toEqual([1]);
+    expect(longestIncreasingSubsequence(array)).toEqual([1]);
   });
 
   it('should give the right length', function () {
-    expect(longestSubsequence(sequence).length).toBe(5);
+    expect(longestIncreasingSubsequence(sequence).length).toBe(5);
   });
 
   it('should work with empty arrays', function () {
-    expect(longestSubsequence([]).length).toBe(0);
+    expect(longestIncreasingSubsequence([]).length).toBe(0);
   });
 
   it('should return the correct path', function () {
-    expect(longestSubsequence(sequence).toString())
+    expect(longestIncreasingSubsequence(sequence).toString())
       .toBe([2, 3, 6, 9, 11].toString());
   });
 
@@ -39,7 +39,7 @@ describe('longest subsequence', function () {
       return b - a;
     };
     var seq = [1, 2, -1];
-    var result = longestSubsequence(seq, cmp);
+    var result = longestIncreasingSubsequence(seq, cmp);
     expect(result.length).toBe(2);
     expect(result).toEqual([1, -1]);
   });
