{"id":510,"date":"2005-03-02T00:58:23","date_gmt":"2005-03-02T05:58:23","guid":{"rendered":"http:\/\/www.xorph.com\/creator\/2005\/03\/02\/pokeacuteblog-entry-from-today-in-class\/"},"modified":"2005-03-02T00:58:23","modified_gmt":"2005-03-02T05:58:23","slug":"pokeacuteblog-entry-from-today-in-class","status":"publish","type":"post","link":"https:\/\/www.xorph.com\/nfd\/2005\/03\/02\/pokeacuteblog-entry-from-today-in-class\/","title":{"rendered":"Pok&amp;eacute;blog entry from today, in class"},"content":{"rendered":"<p>I know how to hash things in programs, despite the fact that the applications of hashing got like two weeks of coverage total in my almost-six years of comp sci study.  Therefore, every time I&#8217;m sweating a bad O(n^2) algorithm and suddenly realize that I can use hashing to significantly reduce its average-case complexity, I feel like some kind of mighty computer genius.  But I&#8217;m not.  I just know how to hash things.<\/p>\n<p>Possibly the reason I feel this way is that nobody else with whom I&#8217;m working on said algorithms&#8211;including my professors&#8211;seems to understand what I&#8217;m talking about, like most of you right now.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>I know how to hash things in programs, despite the fact that the applications of hashing got like two weeks of coverage total in my almost-six years of comp sci study. Therefore, every time I&#8217;m sweating a bad O(n^2) algorithm and suddenly realize that I can use hashing to significantly reduce its average-case complexity, I [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[93],"tags":[],"class_list":["post-510","post","type-post","status-publish","format-standard","hentry","category-programming"],"_links":{"self":[{"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/posts\/510","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/comments?post=510"}],"version-history":[{"count":0,"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/posts\/510\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/media?parent=510"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/categories?post=510"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.xorph.com\/nfd\/wp-json\/wp\/v2\/tags?post=510"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}