fix: algorithm name error (TheAlgorithms#216)

* fix: algorithm name error

the Longest continuous increasing subsequence should be Longest continuous
increasing subsequence

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

Author: imp2002

DIRECTORY.md

@@ -20,7 +20,7 @@
     * [Fibonacci](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/fibonacci.rs)
     * [Knapsack](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/knapsack.rs)
     * [Longest Common Subsequence](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/longest_common_subsequence.rs)
-    * [Longest Increasing Subsequence](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/longest_increasing_subsequence.rs)
+    * [Longest Continuous Increasing Subsequence](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/longest_continuous_increasing_subsequence.rs)
     * [Maximum Subarray](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/maximum_subarray.rs)
   * General
     * [Convex Hull](https://github.com/TheAlgorithms/Rust/blob/master/src/general/convex_hull.rs)

README.md

@@ -32,7 +32,8 @@ These are for demonstration purposes only.
 - [x] [0-1 Knapsack](./src/dynamic_programming/knapsack.rs)
 - [x] [Edit Distance](./src/dynamic_programming/edit_distance.rs)
 - [x] [Longest common subsequence](./src/dynamic_programming/longest_common_subsequence.rs)
-- [x] [Longest increasing subsequence](./src/dynamic_programming/longest_increasing_subsequence.rs)
+- [x] [Longest continuous increasing subsequence](./src/dynamic_programming/longest_continuous_increasing_subsequence.rs)
+- [ ] Longest increasing subsequence
 - [x] [K-Means Clustering](./src/general/kmeans.rs)
 - [x] [Coin Change](./src/dynamic_programming/coin_change.rs)
 - [ ] Rod cut

src/dynamic_programming/longest_increasing_subsequence.rs renamed to src/dynamic_programming/longest_continuous_increasing_subsequence.rs

@@ -1,4 +1,4 @@
-pub fn longest_increasing_subsequence<T: Ord>(input_array: &[T]) -> &[T] {
+pub fn longest_continuous_increasing_subsequence<T: Ord>(input_array: &[T]) -> &[T] {
     let length: usize = input_array.len();
 
     //Handle the base cases
@@ -31,37 +31,43 @@ pub fn longest_increasing_subsequence<T: Ord>(input_array: &[T]) -> &[T] {
 
 #[cfg(test)]
 mod tests {
-    use super::longest_increasing_subsequence;
+    use super::longest_continuous_increasing_subsequence;
 
     #[test]
     fn test_longest_increasing_subsequence() {
         //Base Cases
         let base_case_array: [i32; 0] = [];
-        assert_eq!(&longest_increasing_subsequence(&base_case_array), &[]);
-        assert_eq!(&longest_increasing_subsequence(&[1]), &[1]);
+        assert_eq!(
+            &longest_continuous_increasing_subsequence(&base_case_array),
+            &[]
+        );
+        assert_eq!(&longest_continuous_increasing_subsequence(&[1]), &[1]);
 
         //Normal i32 Cases
         assert_eq!(
-            &longest_increasing_subsequence(&[1, 2, 3, 4]),
+            &longest_continuous_increasing_subsequence(&[1, 2, 3, 4]),
             &[1, 2, 3, 4]
         );
         assert_eq!(
-            &longest_increasing_subsequence(&[1, 2, 2, 3, 4, 2]),
+            &longest_continuous_increasing_subsequence(&[1, 2, 2, 3, 4, 2]),
             &[2, 3, 4]
         );
-        assert_eq!(&longest_increasing_subsequence(&[5, 4, 3, 2, 1]), &[5]);
         assert_eq!(
-            &longest_increasing_subsequence(&[5, 4, 3, 4, 2, 1]),
+            &longest_continuous_increasing_subsequence(&[5, 4, 3, 2, 1]),
+            &[5]
+        );
+        assert_eq!(
+            &longest_continuous_increasing_subsequence(&[5, 4, 3, 4, 2, 1]),
             &[3, 4]
         );
 
         //Non-Numeric case
         assert_eq!(
-            &longest_increasing_subsequence(&['a', 'b', 'c']),
+            &longest_continuous_increasing_subsequence(&['a', 'b', 'c']),
             &['a', 'b', 'c']
         );
         assert_eq!(
-            &longest_increasing_subsequence(&['d', 'c', 'd']),
+            &longest_continuous_increasing_subsequence(&['d', 'c', 'd']),
             &['c', 'd']
         );
     }

src/dynamic_programming/mod.rs

@@ -4,7 +4,7 @@ mod egg_dropping;
 mod fibonacci;
 mod knapsack;
 mod longest_common_subsequence;
-mod longest_increasing_subsequence;
+mod longest_continuous_increasing_subsequence;
 mod maximum_subarray;
 
 pub use self::coin_change::coin_change;
@@ -14,5 +14,5 @@ pub use self::fibonacci::fibonacci;
 pub use self::fibonacci::recursive_fibonacci;
 pub use self::knapsack::knapsack;
 pub use self::longest_common_subsequence::longest_common_subsequence;
-pub use self::longest_increasing_subsequence::longest_increasing_subsequence;
+pub use self::longest_continuous_increasing_subsequence::longest_continuous_increasing_subsequence;
 pub use self::maximum_subarray::maximum_subarray;