aboutsummaryrefslogtreecommitdiff
path: root/microposts
diff options
context:
space:
mode:
authorYuchen Pei <hi@ypei.me>2022-04-14 21:19:57 +1000
committerYuchen Pei <hi@ypei.me>2022-04-14 21:19:57 +1000
commit35483ab1d59bf4da5d432e1a14716d25b2430a19 (patch)
tree19e72a5360d432b95bd4830aaef4d4fe3cb4bd91 /microposts
parent87973ec8a51d55ecfd4131b56d16656fbd698f96 (diff)
minor update
Diffstat (limited to 'microposts')
-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