aboutsummaryrefslogtreecommitdiff
path: root/microposts/boyer-moore.org
diff options
context:
space:
mode:
Diffstat (limited to 'microposts/boyer-moore.org')
-rw-r--r--microposts/boyer-moore.org4
1 files changed, 2 insertions, 2 deletions
diff --git a/microposts/boyer-moore.org b/microposts/boyer-moore.org
index 6298454..8c67b74 100644
--- a/microposts/boyer-moore.org
+++ b/microposts/boyer-moore.org
@@ -7,7 +7,7 @@ The
algorithm for finding the majority of a sequence of elements]] falls in
the category of "very clever algorithms".
-#+begin_example
+#+begin_src c++
int majorityElement(vector<int>& xs) {
int count = 0;
int maj = xs[0];
@@ -18,4 +18,4 @@ the category of "very clever algorithms".
}
return maj;
}
-#+end_example
+#+end_src