Use Asymptotic Analysis to compare the eficiency of algorithms
- Thomas Cormen
- Devin Balkom
.container { | |
display: block; | |
max-width: 600px; | |
position: relative; | |
height: 36px; | |
box-sizing: border-box; | |
border: 1px solid gray; | |
border-radius: 3px; | |
background-color: white; | |
} |
<div class="container"> | |
<input type="text" value="" class="free-typing"></input> | |
<input autocomplete="off" value="Oracul, tell me" class="persistent-placeholder"/> | |
</div> |
"scripts": { | |
"clean": "rm -rf build && mkdir build", | |
"build-css": "node-sass scss/app.scss public/css/app.css", | |
"build-server": "babel -d ./build ./server -s", | |
"build": "npm run clean && npm run build-css && npm run build-server", | |
"lint": "eslint source/ --quiet", | |
"start": "node ./build/index.js", | |
"debug": "node --debug ./build/index.js", | |
"test": "for i in $(ls tests/); do babel-node \"./tests/${i}\" | faucet ; done", | |
"validate": "npm run lint; npm run test && npm outdated --depth 0" |
"scripts": { | |
"start": "npm run check && babel-node app/server.js", | |
}, |
function sqrt(original, rootn) { | |
if (rootn < 1) return; | |
rootn = rootn || (original - 1); | |
var isSqRoot = (rootn * rootn) === original; | |
while (isSqRoot === false) { | |
return sqrt(original, rootn - 1); | |
} |
The MIT License (MIT) | |
Copyright (c) 2015 Justin Perry | |
Permission is hereby granted, free of charge, to any person obtaining a copy of | |
this software and associated documentation files (the "Software"), to deal in | |
the Software without restriction, including without limitation the rights to | |
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of | |
the Software, and to permit persons to whom the Software is furnished to do so, | |
subject to the following conditions: |
Table of Contents generated with DocToc
Table of Contents generated with DocToc