diff --git a/src/lib.rs b/src/lib.rs
index 5e2d375..6ff70e5 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -16,9 +16,9 @@ use num_traits::{
 
 /// Find all of the roots of a polynomial using Aberth's method
 ///
-/// Polynomial of the form `f(x) = a + b*x + c*x^2 + d*x^3 + ...`.
+/// Polynomial of the form `f(x) = a + b*x + c*x^2 + d*x^3 + ...`
 ///
-/// `polynomial` is a slice containing the coefficients `[a, b, c, d, ...]`.
+/// `polynomial` is a slice containing the coefficients `[a, b, c, d, ...]`
 ///
 /// When two successive iterations produce roots with less than `epsilon`
 /// delta, the roots are returned.
@@ -176,7 +176,8 @@ mod feature_std {
   /// use aberth::{AberthSolver, Complex};
   ///
   /// let mut solver = AberthSolver::new();
-  /// let roots_a: Vec<Complex<f32>> = solver.find_roots(&[-1., 2., 0., 4., 11.]).to_vec();
+  /// let roots_a: Vec<Complex<f32>> =
+  ///   solver.find_roots(&[-1., 2., 0., 4., 11.]).to_vec();
   /// let roots_b = solver.find_roots(&[-28., 39., -12., 1.]);
   /// roots_a[0];
   /// ```
@@ -211,9 +212,9 @@ mod feature_std {
 
     /// Find all the complex roots of the polynomial
     ///
-    /// Polynomial is given in the form `f(x) = a + b*x + c*x^2 + d*x^3 + ...`.
+    /// Polynomial is given in the form `f(x) = a + b*x + c*x^2 + d*x^3 + ...`
     ///
-    /// `polynomial` is a slice containing the coefficients `[a, b, c, d, ...]`.
+    /// `polynomial` is a slice containing the coefficients `[a, b, c, d, ...]`
     pub fn find_roots<C: ComplexCoefficient<F>>(
       &mut self,
       polynomial: &[C],