niftymonkey

### Keybase proof

I hereby claim:

  * I am niftymonkey on github.
  * I am niftymonkey (https://keybase.io/niftymonkey) on keybase.
  * I have a public key ASBr3N5WiFNT32Rw4RiKRGUBpXpss-d7kfwHbid61snrigo

To claim this, I am signing this object:

niftymonkey

I can't remember what I replied

niftymonkey

{
  "title": "Mobile Stats - Mark",
  "services": {
    "query": {
      "list": {
        "0": {
          "id": 0,
          "color": "#58140C",
          "alias": "Resends",
          "pin": false,

niftymonkey

require.config({
  
  paths: {

      modernizr: "libs/modernizr-2.5.3",
      jquery: "libs/jquery-1.7.2",
      underscore: "libs/lodash-0.3.1",
      backbone: "libs/backbone-0.9.2",

      text: "plugins/text-2.0.0"

niftymonkey

// 1. Write a class to support the following code:

function Person(name) {
    this.name = name;
};

var thomas = new Person('Thomas');
var amy = new Person('Amy');

thomas.name // --> "Thomas"

niftymonkey

/////////////////////////////////////////////
// Functional
/////////////////////////////////////////////

(function(functionName, container) {

    function logMsg(color, make) {
        console.log("I'm a " + color + " " + make);
    };

niftymonkey

var countdown = (function () {
    var index;

    function log(){
        console.log(index);
    }

    function iterate(){
        log();
        if(index>1) setTimeout(iterate, 1000);

niftymonkey

function isCreditCard( CC ) {
     if (CC !== undefined && CC.length > 0 && CC.length <= 19) {
          var sum = 0,
              mul = 1,
              l = CC.length;
  
          for (i = 0; i < l; i++) {
               digit = CC.substring(l-i-1,l-i);
               tproduct = parseInt(digit ,10)*mul;
               if (tproduct >= 10)

niftymonkey

(defn insert [val lst]
  (cond
    (empty? lst) (list val)            ; if it's an empty list, initialize it
    (> (first lst) val) (conj lst val) ; if the first item is smaller than the first of lst, just conj
    :else 
    (conj (insert val (rest lst)) (first lst)))) ; otherwise we need to keep calling insert recursively

(defn insertion-sort [lst]
  (loop [list lst result '()]  ; create local variables for our result set and the list passed in
    (if (empty? list) result   ; if the list passed in was empty, just return our empty result list