From 76dfa611ed480f81b33bf3966c2dddc7cc09159f Mon Sep 17 00:00:00 2001
From: Charlie Barto <bartoc@umich.edu>
Date: Thu, 27 Mar 2014 15:13:10 -0400
Subject: [PATCH] fixed doc comment

---
 lib/pure/algorithm.nim | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim
index 49d1ac972b..37fbc948c0 100644
--- a/lib/pure/algorithm.nim
+++ b/lib/pure/algorithm.nim
@@ -64,10 +64,11 @@ proc lowerBound*[T](a: openarray[T], key: T, cmp: proc(x,y: T): int {.closure.})
   ## `cmp` is the comparator function to use, the expected return values are the same as
   ## that of system.cmp
   ## 
-  ## example:
-  ## `var arr = @[1,2,3,5,6,7,8,9]`
-  ## `arr.insert(4, arr.lowerBound(4))`
-  ## after running the above arr is `[1,2,3,4,5,6,7,8,9]`
+  ## example::
+  ##
+  ##   var arr = @[1,2,3,5,6,7,8,9]
+  ##   arr.insert(4, arr.lowerBound(4))
+  ## `after running the above arr is `[1,2,3,4,5,6,7,8,9]`
   result = a.low
   var pos = result
   var count, step: int