From 78e79c7688feae5e0da75a87f7f6293c8502125a Mon Sep 17 00:00:00 2001
From: Yuchen Pei <me@ypei.me>
Date: Sun, 2 Aug 2020 21:34:32 +0200
Subject: Added two mposts on ia and fsf

---
 microposts/ia-lawsuit.md~ | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 microposts/ia-lawsuit.md~

(limited to 'microposts/ia-lawsuit.md~')

diff --git a/microposts/ia-lawsuit.md~ b/microposts/ia-lawsuit.md~
new file mode 100644
index 0000000..e3e0f9c
--- /dev/null
+++ b/microposts/ia-lawsuit.md~
@@ -0,0 +1,17 @@
+---
+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;
+    }
+
-- 
cgit v1.2.3