Re: [PATCH] path-list documentation: document all functions and data structures
- From
Jakub Narebski <jnareb@gmail.com>
- Date
- Jun 15, 2008, 09:01 UTC
- Message-ID
- <m3k5groyw8.fsf@localhost.localdomain>
- In-Reply-To
- <1213485725-6755-1-git-send-email-vmiklos@frugalware.org>
Miklos Vajna <vmiklos@frugalware.org> writes:
> +NOTE: It is more efficient to build an unsorted list and sort it > +afterwards, instead of building a sorted list `(O(n log n)` instead of > +`O(n^2))`.
I think there is typo here (misplaced backticks '`' on the wrong side of enclosing parentheses), and this fragment should read:
+afterwards, instead of building a sorted list (`O(n log n)` instead of +`O(n^2)`).
-- Jakub Narebski Poland ShadeHawk on #git