merged master

Author: blundell

.editorconfig

@@ -0,0 +1,22 @@
+# EditorConfig helps developers define and maintain consistent
+# coding styles between different editors and IDEs
+# editorconfig.org
+
+root = true
+
+
+[*]
+
+indent_style = space
+indent_size = 2
+end_of_line = lf
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true
+
+[*.md]
+trim_trailing_whitespace = false
+
+[Makefile]
+indent_style = tab
+indent_size = 4

.gitignore

@@ -1,4 +1,5 @@
 .DS_Store
 .idea
 /out
-/core
+/core
+node_modules

.jshintignore

@@ -0,0 +1,4 @@
+node_modules
+
+# Pretty dodgy JS to keep it so small
+shortest-fizz-buzz

.jshintrc

@@ -0,0 +1,33 @@
+{
+  "node": true,
+  "browser": true,
+  "jquery": true,
+  "devel": true,
+  "nonstandard": true,
+  "worker": true,
+  "esnext": true,
+  "bitwise": false,
+  "boss": true,
+  "camelcase": true,
+  "curly": true,
+  "eqeqeq": true,
+  "eqnull": true,
+  "expr": true,
+  "forin": true,
+  "immed": true,
+  "latedef": true,
+  "newcap": true,
+  "noarg": true,
+  "quotmark": "single",
+  "regexp": true,
+  "strict": false,
+  "undef": true,
+  "unused": true,
+  "trailing": true,
+  "smarttabs": true,
+  "immed": true,
+  "globals": {
+    "it": true,
+    "describe": true
+  }
+}

byte-string/README.md

@@ -0,0 +1,15 @@
+# Byte String
+
+Convert a number to a string that represents a rounded size in bytes.
+
+## Example
+
+```
+f(156833213) // => "149.57 MB"
+f(8101)      // => "7.91 KB"
+f(12331, 3)  // => "12.042 KB"
+```
+
+## Source
+
+By [Riga](https://github.com/riga).

byte-string/byte-string.js

@@ -0,0 +1,8 @@
+module.exports = function (bytes, precision) {
+  var suffixes = ['B', 'KB', 'MB', 'GB', 'TB', 'PB', 'EB', 'ZB', 'YB'],
+      factor   = Math.pow(10, precision > 0 ? precision : 2);
+  // Using a for loop since it's perfect for this kind of problem
+  for (var i = bytes, k = 0; i >= 1024 && k < suffixes.length; i /= 1024, k++) {}
+  // Return the number rounded to precision
+  return (Math.round(i * factor) / factor) + ' ' + suffixes[k];
+};

debounce/Readme.md

@@ -0,0 +1,5 @@
+# Debounce
+
+Write a function that accepts a function and timeout, `x`, in number of milliseconds. It will return a new function that can only be executed on per timeout period - and if the function is invoked during the timeout period, the timeout period restarts. This is useful for functions that can be need to be blocked on subsequent attempts over short period of times. Once such is example, is clicks on a button.
+
+Once written, add a third parameter that will allow the function to be executed immediately if set to true. Otherwise the function will run at the end of the timeout period.

debounce/debounce.js

@@ -0,0 +1,22 @@
+module.exports = function (fn, delay, execAsap) {
+  var timeout; // Keep a reference to the timeout outside the function
+
+  return function () {
+    // Keep the functions execution context and arguments in tact
+    var that = this,
+        args = arguments;
+
+    // If we already have a function ready to execute, clear it
+    // Else if we are allowed to execute immediately, call the function
+    if (timeout) {
+      clearTimeout(timeout);
+    } else if (execAsap) {
+      fn.apply(that, args);
+    }
+
+    timeout = setTimeout(function () {
+      execAsap || fn.apply(that, args);
+      timeout = null;
+    }, delay || 100);
+  };
+};

factorial/factorial.js

@@ -0,0 +1,29 @@
+// Recursive function example
+exports.recursive = function factorial (number) {
+  if (number < 2) { return 1; }
+
+  return number * factorial(number - 1);
+};
+
+// Iterative solution
+exports.iterative = function (number) {
+  var result = 1;
+
+  for (var i = 1; i <= number; i++) {
+    result *= i;
+  }
+
+  return result;
+};
+
+// Iterative using a reverse loop
+exports.iterativeReverse = function (number) {
+  var result = 1;
+
+  while (number) {
+    result *= number;
+    number -= 1;
+  }
+
+  return result;
+};

factorial/factorial.php

@@ -0,0 +1,32 @@
+<?php
+
+    // Iterative solution
+    function factorial($number){
+        $result = 1;
+        for($i=1; $i <= $number ; $i++){
+            $result *=$i;
+        }
+        return $result;
+    }
+
+    // Iterative using a reverse loop
+    function factorialReverse($number){
+        $result = 1;
+        while($number !=1){
+            $result *= $number;
+            $number--;
+        }
+        return $result;
+    }
+
+    // Recursive solution
+    function factorialRecursive($number){
+        if($number ==1){
+            return 1;
+        }
+        else{
+            return $number *factorialRecursive($number-1);
+        }
+    }
+
+?>