diff --git a/src/algorithm/neighbour/fastpair.rs b/src/algorithm/neighbour/fastpair.rs
index 9bf82dd..410ca5b 100644
--- a/src/algorithm/neighbour/fastpair.rs
+++ b/src/algorithm/neighbour/fastpair.rs
@@ -181,12 +181,15 @@ impl<'a, T: RealNumber + FloatNumber, M: Array2<T>> FastPair<'a, T, M> {
 
     ///
     /// Return order dissimilarities from closest to furthest
-    /// 
+    ///
     #[allow(dead_code)]
     pub fn ordered_pairs(&self) -> std::vec::IntoIter<&PairwiseDistance<T>> {
         // improvement: implement this to return `impl Iterator<Item = &PairwiseDistance<T>>`
         // need to implement trait `Iterator` for `Vec<&PairwiseDistance<T>>`
-        let mut distances = self.distances.values().collect::<Vec<&PairwiseDistance<T>>>();
+        let mut distances = self
+            .distances
+            .values()
+            .collect::<Vec<&PairwiseDistance<T>>>();
         distances.sort_by(|a, b| a.partial_cmp(b).unwrap());
         distances.into_iter()
     }
@@ -631,7 +634,7 @@ mod tests_fastpair {
             if previous == -1.0 {
                 previous = p.distance.unwrap();
             } else {
-                let current = p.distance.unwrap(); 
+                let current = p.distance.unwrap();
                 assert!(current >= previous);
                 previous = current;
             }
diff --git a/src/linalg/basic/arrays.rs b/src/linalg/basic/arrays.rs
index e11bb6c..7d0c77a 100644
--- a/src/linalg/basic/arrays.rs
+++ b/src/linalg/basic/arrays.rs
@@ -1570,7 +1570,7 @@ pub trait Array2<T: Debug + Display + Copy + Sized>: MutArrayView2<T> + Sized +
         mean
     }
 
-    /// copy coumn as a vector
+    /// copy column as a vector
     fn copy_col_as_vec(&self, col: usize, result: &mut Vec<T>) {
         for (r, result_r) in result.iter_mut().enumerate().take(self.shape().0) {
             *result_r = *self.get((r, col));