One of the first things you learn with AngularJS is the amazing two-way data binding abilities of $scope. $scope, directives, and curly brackets can magically add content to your website.

The wonderful thing about solving an algorithm is there are generally various solutions. Many ask what is the best solution? Opinions on the best may be impacted by personal preferences, but the efficiency of your code is most important. Big O notation is used in computer science and mathematics to describe how algorithms respond to different inputs. Time Complexity is the relation of input size and the algorithm’s execution time. In Javascript, the input usually refers to an array or object. This blog post will cover four of the most basic types of time complexities of Big O notation: Constant, Logarithmic, Linear, and Quadratic.

Backbone.js provides components such as models, collections, and views that give structure to an application. The importance of these components is decreasing the dependence of different parts of the code, which protects the application from breaking if one part of the code fails. Backbone uses Underscore.js.

At some point you will need to create a counter for an algorithm. The traditional approach is to use the each function to iterate over the the collection of data and increment the count every time that value is found.