style: remove duplicated the (#779)

chore: remove repetitive words

Signed-off-by: friendlyping <[email protected]>

Author: friendlyping

src/graph/decremental_connectivity.rs

@@ -4,7 +4,7 @@ use std::collections::HashSet;
 /// Meaning deletion of an edge (u,v) and checking whether two vertecies are still connected.
 ///
 /// # Complexity
-/// The preprocessing phase runs in O(n) time, where n is the the number of vertecies in the forest.
+/// The preprocessing phase runs in O(n) time, where n is the number of vertecies in the forest.
 /// Deletion runs in O(log n) and checking for connectivity runs in O(1) time.
 ///
 /// # Sources

src/math/interest.rs

@@ -14,7 +14,7 @@ pub fn simple_interest(principal: f64, annual_rate: f64, years: f64) -> (f64, f6
 
 // function to calculate compound interest compounded over periods or continuously
 pub fn compound_interest(principal: f64, annual_rate: f64, years: f64, period: Option<f64>) -> f64 {
-    // checks if the the period is None type, if so calculates continuous compounding interest
+    // checks if the period is None type, if so calculates continuous compounding interest
     let value = if period.is_none() {
         principal * E.powf(annual_rate * years)
     } else {

src/math/nthprime.rs

@@ -1,5 +1,5 @@
 // Generate the nth prime number.
-// Algorithm is inspired by the the optimized version of the Sieve of Eratosthenes.
+// Algorithm is inspired by the optimized version of the Sieve of Eratosthenes.
 pub fn nthprime(nth: u64) -> u64 {
     let mut total_prime: u64 = 0;
     let mut size_factor: u64 = 2;