From df5e8f65bcc1ed3353c45a80baab126476aa5011 Mon Sep 17 00:00:00 2001 From: Nick Mathewson Date: Fri, 26 Dec 2008 17:35:08 +0000 Subject: Add more missing documentation, and correct an error in container.c documentation: Don't introduce two parameters called n when you're calling an algorithm O(n). svn:r17783 --- src/common/container.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'src/common/container.c') diff --git a/src/common/container.c b/src/common/container.c index 4fed9184d..f5cde0261 100644 --- a/src/common/container.c +++ b/src/common/container.c @@ -1199,7 +1199,7 @@ digestmap_size(const digestmap_t *map) * function for an array of type elt_t*. * * NOTE: The implementation kind of sucks: It's O(n log n), whereas finding - * the nth element of a list can be done in O(n). Then again, this + * the kth element of an n-element list can be done in O(n). Then again, this * implementation is not in critical path, and it is obviously correct. */ #define IMPLEMENT_ORDER_FUNC(funcname, elt_t) \ static int \ -- cgit v1.2.3