37 lines
1.4 KiB
HTML
37 lines
1.4 KiB
HTML
<h1 id="awesome-big-o">Awesome Big O</h1>
|
||
<p>A curated list of materials about Big O notation.</p>
|
||
<h2 id="cheat-sheets">Cheat Sheets</h2>
|
||
<ul>
|
||
<li><a href="http://bigocheatsheet.com">Big-O Cheat Sheet</a></li>
|
||
<li><a href="http://www.sorting-algorithms.com/">Visualization of
|
||
Sorting Algorithms</a></li>
|
||
</ul>
|
||
<p>## Lecture Notes - <a
|
||
href="http://web.mit.edu/16.070/www/lecture/big_o.pdf">MIT’s
|
||
Introduction to Computers & Programming</a> - <a
|
||
href="https://www.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/big-o-notation">Khan
|
||
Academy’s Algorithms Course</a></p>
|
||
<h2 id="questions-answers">Questions & Answers</h2>
|
||
<ul>
|
||
<li><a href="http://stackoverflow.com/a/487278/472433">Plain English
|
||
explanation of Big O</a></li>
|
||
<li><a href="http://stackoverflow.com/a/2307314/472433">What does O(log
|
||
n) mean exactly?</a></li>
|
||
</ul>
|
||
<h2 id="video-lectures">Video Lectures</h2>
|
||
<ul>
|
||
<li><a
|
||
href="https://class.coursera.org/algo-004/lecture/169">Algorithms:
|
||
Design and Analysis, Part 1, Week 1: Asymptotic Analysis</a> on Coursera
|
||
by Tim Roughgarden</li>
|
||
</ul>
|
||
<h2 id="language-specific">Language Specific</h2>
|
||
<ul>
|
||
<li>[Scala Collections]
|
||
(http://docs.scala-lang.org/overviews/collections/performance-characteristics.html)</li>
|
||
<li>[Python Collections]
|
||
(https://wiki.python.org/moin/TimeComplexity)</li>
|
||
<li>[List of Big-O for PHP functions]
|
||
(http://stackoverflow.com/a/2484455/472433)</li>
|
||
</ul>
|