I think this illustrates the concept of Big-O complexity pretty good. O(1): random access to an element in a collection, dependent on indexing O(n): list iterations O(n^2): nested loops
This site runs, in part, on a reverse proxy (along with the Ghost publishing platform). What is that? Why is it used? I don't know when it came about but this concept has
Generating Combinations TopCoder How Ghost Migrated From Dedicated Servers to DigitalOcean: Ghost runs this site and I found this interesting reading. Remote Desktop Roundup: TeamViewer vs. Splashtop vs. Windows RDP College student reflects
Quick summary and examples of git config settings I set on a new installation of Git.
Machine Learning @ Standford University, Drupal, Testing NodeJS apps using Mocha, Chai and SinonJS, ApexDesk Electric Height adjustable standing desk