Edited docs

Author: flakusha

README.md

@@ -37,7 +37,7 @@ point too
 | Ksort | modified version of quicksort, faster than heap at less than 7 million elements | `n`<sup>`2`</sup> | `nlog`<sub>2</sub>`n` | `n` or `logn` |
 | Selection | the least number of swaps among all the algorithms | `n`<sup>`2`</sup>; `n` | `n`<sup>`2`</sup>; `1` | `1` |
 | Double selection | modified version of selection sort with more workload, but better efficiency | `n`<sup>`2`</sup>; `n` | `n`<sup>`2`</sup>; `1` | more than Selection |
-| Shellsort | it is optimization of insertion sort | `n`<sup>`3/2`</sup> or `nlog`<sup>`2`</sup>`n` | `nlogn` | `1` |
+| Shellsort | it is optimization of insertion sort | `n`<sup>`3/2`</sup> or `nlogn`<sup>`2`</sup> | `nlogn` | `1` |
 | Slow | it's slow, who would ever need it? | | | |
 | Smooth | variant of heapsort, good for nearly sorted data | `nlogn` | `n` | `n` or `1` |
 | Stooge | it's a bit faster than slow sort | `n`<sup>`2.7095`</sup> | | `n` |

src/lib.rs

@@ -19,7 +19,7 @@
 //! | Ksort | modified version of quicksort, faster than heap at less than 7 million elements | `n`<sup>`2`</sup> | `nlog`<sub>2</sub>`n` | `n` or `logn` |
 //! | Selection | the least number of swaps among all the algorithms | `n`<sup>`2`</sup>; `n` | `n`<sup>`2`</sup>; `1` | `1` |
 //! | Double selection | modified version of selection sort with more workload, but better efficiency | `n`<sup>`2`</sup>; `n` | `n`<sup>`2`</sup>; `1` | more than Selection |
-//! | Shellsort | it is optimization of insertion sort | `n`<sup>`3/2`</sup> or `nlog`<sup>`2`</sup>`n` | `nlogn` | `1` |
+//! | Shellsort | it is optimization of insertion sort | `n`<sup>`3/2`</sup> or `nlogn`<sup>`2`</sup> | `nlogn` | `1` |
 //! | Slow | it's slow, who would ever need it? | | | |
 //! | Smooth | variant of heapsort, good for nearly sorted data | `nlogn` | `n` | `n` or `1` |
 //! | Stooge | it's a bit faster than slow sort | `n`<sup>`2.7095`</sup> | | `n` |