Move misplaced algorithms to correct folders (#188)

Author: Copilot

DIRECTORY.md

@@ -6,8 +6,9 @@
   * [Decision Tree](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/decision_tree.r)
   * [Gradient Boosting Algorithms](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/gradient_boosting_algorithms.r)
   * [Knn](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/knn.r)
-  * [Lasso](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/lasso.r)
   * [Light Gbm](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/light_gbm.r)
+  * [Logistic Regression](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/logistic_regression.r)
+  * [Logistic Regression 2](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/logistic_regression_2.r)
   * [Naive Bayes](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/naive_bayes.r)
   * [Random Forest](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/random_forest.r)
   * [Svm](https://github.com/TheAlgorithms/R/blob/HEAD/classification_algorithms/svm.r)
@@ -51,8 +52,6 @@
   * [Depth First Search](https://github.com/TheAlgorithms/R/blob/HEAD/graph_algorithms/depth_first_search.r)
   * [Dijkstra Shortest Path](https://github.com/TheAlgorithms/R/blob/HEAD/graph_algorithms/dijkstra_shortest_path.r)
 
-## [Levenshtein](https://github.com/TheAlgorithms/R/blob/HEAD//levenshtein.r)
-
 ## Mathematics
   * [Amicable Numbers](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/amicable_numbers.r)
   * [Armstrong Number](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/armstrong_number.r)
@@ -63,7 +62,6 @@
   * [Fibonacci](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/fibonacci.r)
   * [First N Fibonacci](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/first_n_fibonacci.r)
   * [Greatest Common Divisor](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/greatest_common_divisor.r)
-  * [Hamming Distance](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/hamming_distance.r)
   * [Josephus Problem](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/josephus_problem.r)
   * [Least Common Multiple](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/least_common_multiple.r)
   * [Perfect Number](https://github.com/TheAlgorithms/R/blob/HEAD/mathematics/perfect_number.r)
@@ -80,13 +78,8 @@
 
 ## Regression Algorithms
   * [Ann](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/ann.r)
-  * [Gradient Boosting Algorithms](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/gradient_boosting_algorithms.r)
-  * [Knn](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/knn.r)
-  * [Light Gbm](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/light_gbm.r)
   * [Linear Regression](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/linear_regression.r)
   * [Linearregressionrawr](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/linearregressionrawr.r)
-  * [Logistic Regression](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/logistic_regression.r)
-  * [Logistic Regression 2](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/logistic_regression_2.r)
   * [Multiple Linear Regression](https://github.com/TheAlgorithms/R/blob/HEAD/regression_algorithms/multiple_linear_regression.r)
 
 ## Searches
@@ -123,9 +116,11 @@
 ## String Manipulation
   * [Burrows](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/burrows.r)
   * [Findpalindrome](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/findpalindrome.r)
+  * [Hamming Distance](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/hamming_distance.r)
   * [Is.Anagram](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/is.anagram.r)
   * [Is.Lower](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/is.lower.r)
   * [Is.Uppercase](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/is.uppercase.r)
+  * [Levenshtein](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/levenshtein.r)
   * [Longest.Palindromic.Subsequence](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/longest.palindromic.subsequence.r)
   * [Longest.Substring.No.Repeat](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/longest.substring.no.repeat.r)
   * [Manacher.Longest.Palindrome](https://github.com/TheAlgorithms/R/blob/HEAD/string_manipulation/manacher.longest.palindrome.r)

classification_algorithms/lasso.r

@@ -550,12 +550,12 @@
 cat("Standard algorithm: LCS length =", standard_result, 
     "Time:", sprintf("%.6f", standard_time), "seconds\n")
 </code></pre>
-<pre><code>## Standard algorithm: LCS length = 59 Time: 0.050064 seconds
+<pre><code>## Standard algorithm: LCS length = 59 Time: 0.052980 seconds
 </code></pre>
 <pre><code class="language-r">cat(&quot;Optimized algorithm: LCS length =&quot;, optimized_result, 
     &quot;Time:&quot;, sprintf(&quot;%.6f&quot;, optimized_time), &quot;seconds\n&quot;)
 </code></pre>
-<pre><code>## Optimized algorithm: LCS length = 59 Time: 0.046882 seconds
+<pre><code>## Optimized algorithm: LCS length = 59 Time: 0.049993 seconds
 </code></pre>
 <pre><code class="language-r">cat(&quot;Results match:&quot;, standard_result == optimized_result, &quot;\n\n&quot;)
 </code></pre>

…ression_algorithms/logistic_regression.r …ication_algorithms/logistic_regression.rregression_algorithms/logistic_regression.r renamed to classification_algorithms/logistic_regression.r regression_algorithms/logistic_regression.r renamed to classification_algorithms/logistic_regression.r

@@ -540,7 +540,7 @@ cat("Standard algorithm: LCS length =", standard_result,
 ```
 
 ```
-## Standard algorithm: LCS length = 59 Time: 0.050064 seconds
+## Standard algorithm: LCS length = 59 Time: 0.052980 seconds
 ```
 
 ``` r
@@ -549,7 +549,7 @@ cat("Optimized algorithm: LCS length =", optimized_result,
 ```
 
 ```
-## Optimized algorithm: LCS length = 59 Time: 0.046882 seconds
+## Optimized algorithm: LCS length = 59 Time: 0.049993 seconds
 ```
 
 ``` r

…ssion_algorithms/logistic_regression_2.r …ation_algorithms/logistic_regression_2.rregression_algorithms/logistic_regression_2.r renamed to classification_algorithms/logistic_regression_2.r regression_algorithms/logistic_regression_2.r renamed to classification_algorithms/logistic_regression_2.r

@@ -412,7 +412,7 @@
 </code></pre>
 <pre><code class="language-r">cat(&quot;Time taken:&quot;, sprintf(&quot;%.4f sec&quot;, opt_time), &quot;\n&quot;)
 </code></pre>
-<pre><code>## Time taken: 0.0148 sec
+<pre><code>## Time taken: 0.0189 sec
 </code></pre>
 <pre><code class="language-r"># Verify correctness with basic DP (smaller sample for time comparison)
 nums_small &lt;- nums_perf[1:100]

documentation/longest_common_subsequence.html

@@ -398,7 +398,7 @@ cat("Time taken:", sprintf("%.4f sec", opt_time), "\n")
 ```
 
 ```
-## Time taken: 0.0148 sec
+## Time taken: 0.0189 sec
 ```
 
 ``` r