aboutsummaryrefslogtreecommitdiff
path: root/microposts/boyer-moore.md
diff options
context:
space:
mode:
authorYuchen Pei <me@ypei.me>2021-07-01 15:16:19 +1000
committerYuchen Pei <me@ypei.me>2021-07-01 15:16:19 +1000
commitbd3b4e7d8a436685f8b676da8f6ffe9498ab2e3f (patch)
tree1d29d70ddb35b18407c69792cd76e66d2a2280b6 /microposts/boyer-moore.md
parent661762ba8fd5fd685bfbe99473d7286efa85b381 (diff)
Added copyright notices and license headers to website content.
also removed more unused files.
Diffstat (limited to 'microposts/boyer-moore.md')
-rw-r--r--microposts/boyer-moore.md17
1 files changed, 0 insertions, 17 deletions
diff --git a/microposts/boyer-moore.md b/microposts/boyer-moore.md
deleted file mode 100644
index e3e0f9c..0000000
--- a/microposts/boyer-moore.md
+++ /dev/null
@@ -1,17 +0,0 @@
----
-date: 2018-06-04
----
-
-The [Boyer-Moore algorithm for finding the majority of a sequence of elements](https://en.wikipedia.org/wiki/Boyer–Moore_majority_vote_algorithm) falls in the category of "very clever algorithms".
-
- int majorityElement(vector<int>& xs) {
- int count = 0;
- int maj = xs[0];
- for (auto x : xs) {
- if (x == maj) count++;
- else if (count == 0) maj = x;
- else count--;
- }
- return maj;
- }
-