From 8c3f887e4f8da7178daac0a54164e00387a23195 Mon Sep 17 00:00:00 2001 From: Yuchen Pei Date: Sun, 2 Aug 2020 21:36:13 +0200 Subject: removed emacs temp files. --- microposts/fsf-membership.md~ | 9 --------- microposts/ia-lawsuit.md~ | 17 ----------------- 2 files changed, 26 deletions(-) delete mode 100644 microposts/fsf-membership.md~ delete mode 100644 microposts/ia-lawsuit.md~ diff --git a/microposts/fsf-membership.md~ b/microposts/fsf-membership.md~ deleted file mode 100644 index 614fd31..0000000 --- a/microposts/fsf-membership.md~ +++ /dev/null @@ -1,9 +0,0 @@ ---- -date: 2020-08-02 ---- - -The four big publishers Hachette, HarperCollins, Wiley, and Penguin Random House are still pursuing Internet Archive. - -> [Their] lawsuit does not stop at seeking to end the practice of Controlled Digital Lending. These publishers call for the destruction of the 1.5 million digital books that Internet Archive makes available to our patrons. This form of digital book burning is unprecedented and unfairly disadvantages people with print disabilities. For the blind, ebooks are a lifeline, yet less than one in ten exists in accessible formats. Since 2010, Internet Archive has made our lending library available to the blind and print disabled community, in addition to sighted users. If the publishers are successful with their lawsuit, more than a million of those books would be deleted from the Internet’s digital shelves forever. - -- [Libraries lend books, and must continue to lend books: Internet Archive responds to publishers’ lawsuit](https://blog.archive.org/2020/07/29/internet-archive-responds-to-publishers-lawsuit/) \ No newline at end of file diff --git a/microposts/ia-lawsuit.md~ b/microposts/ia-lawsuit.md~ deleted file mode 100644 index e3e0f9c..0000000 --- a/microposts/ia-lawsuit.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& 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