commit 22ffeb0cc463a3ee937be409680841bc65655c8d Spenser Truex <web@spensertruex.com> 2019-09-14 14:08:19 -0700 Update README.org
README.org | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-)
diff --git a/README.org b/README.org index 848fd87..8b8ad96 100644 --- a/README.org +++ b/README.org @@ -13,9 +13,7 @@ The only external function is `len`. (len 3 '(1 2 3) #'/=) ;=> NIL #+END_SRC * Complexity - Comparing the length of some lists with lengths n_i in *N* requires going - across all of their elements. -O(\sum_{n=0}^{n-1}n_i) +Comparing the length of some lists with the sum of their lengths *N* is O(N). -With a short-circuit length comparsion, the worst case scenario is the same, -with the best case O(1) and average case of O(min{N}). +With a short-circuit length comparsion, the worst case scenario is the same, +with the best case O(1) and average case of O(min(N)).