diff --git a/Cargo.toml b/Cargo.toml
index a63e515..9cbdbac 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -4,10 +4,10 @@ version = "0.3.0"
 authors = ["Michael Neumann <mneumann@ntecs.de>"]
 license = "BSD-3-Clause"
 repository = "https://github.com/mneumann/munkres-rs"
-description = "Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem"
+description = "Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem with O(n^3) time complexity"
 keywords = ["algorithm", "optimization"]
 include = ["src/*.rs", "Cargo.toml", "LICENSE", "README.md"]
 
 [dependencies]
 fixedbitset = "0.1"
-ndarray = "0.10"
+ndarray = "0.11"
diff --git a/README.md b/README.md
index d420248..f9a20e8 100644
--- a/README.md
+++ b/README.md
@@ -3,7 +3,8 @@
 [travis-image]: https://travis-ci.org/mneumann/munkres-rs.svg?branch=master
 [travis-link]: https://travis-ci.org/mneumann/munkres-rs
 
-Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem written in Rust.
+Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem
+written in Rust. Time complexity is O(n^3).
 
 This is a modified port from https://github.com/bmc/munkres.
 
diff --git a/rustfmt.toml b/rustfmt.toml
deleted file mode 100644
index 44148a2..0000000
--- a/rustfmt.toml
+++ /dev/null
@@ -1 +0,0 @@
-reorder_imports = true