<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>links.lmorchard.com - #bigo</title>
    <link>/tags/bigo/</link>
    <description>Recent bookmarks tagged #bigo</description>
    <lastBuildDate>Mon, 02 Nov 2026 08:24:55 +0000</lastBuildDate>
    <item>
      <title>Big-O Algorithm Complexity Cheat Sheet (Know Thy Complexities!) @ericdrowell</title>
      <link>https://www.bigocheatsheet.com/</link>
      <description>Hi there!  This webpage covers the space and time Big-O complexities of common algorithms used in Computer Science.  When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn&#39;t be stumped when asked about them.  Over the last few years, I&#39;ve interviewed at several Silicon Valley startups, and also some bigger companies, like Google, Facebook, Yahoo, LinkedIn, and Uber, and each time that I prepared for an interview, I thought to myself &#34;Why hasn&#39;t someone created a nice Big-O cheat sheet?&#34;.  So, to save all of you fine folks a ton of time, I went ahead and created one.  Enjoy! - Eric&lt;br/&gt;&#xA;&lt;p&gt;&lt;strong&gt;Tags:&lt;/strong&gt; #bigo #compsci&lt;/p&gt;</description>
      <pubDate>Tue, 19 Nov 2024 22:36:55 +0000</pubDate>
      <guid isPermaLink="false">linkding-ssg:bookmark:29849</guid>
      <category>bigo</category>
      <category>compsci</category>
    </item>
  </channel>
</rss>
