Created
March 31, 2017 01:57
-
-
Save jl91/1227e2cc0c2f146f316fd69030bd41f1 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// var nomes = [ | |
// "John", | |
// 'João', | |
// 'Marcia', | |
// 'Neide', | |
// 'Gabriel', | |
// 'Silvia', | |
// 'Maicon', | |
// 'daniel' | |
// ]; | |
// | |
// | |
// var sizeOfNomes = nomes.length; | |
// for (var index = 0; index < sizeOfNomes; index++) { | |
// console.log(nomes[index]); | |
// } | |
// | |
// var index2 = 0; | |
// | |
// while (index2 < sizeOfNomes) { | |
// console.log(nomes[index2]); | |
// index2++; | |
// } | |
// var index3 = 0; | |
// while (true) { | |
// console.log(index3); | |
// index3++; | |
// } | |
// | |
// for (var index4 = 0; ; index4++) { | |
// console.log(index4); | |
// } | |
// | |
// var index5 = 0; | |
// do { | |
// console.log(index5); | |
// index5++; | |
// } while (true); | |
//recursividade | |
// function recursiveLoop(index6){ | |
// console.log(index6); | |
// index6 = recursiveLoop(index6++); | |
// return index6; | |
// } | |
// | |
// recursiveLoop(0); | |
//clojure em php | |
// function callItSelf(numero1){ | |
// return function(numero2){ | |
// return numero1 + numero2; | |
// } | |
// } | |
// | |
// var otherFunction = callItSelf(5); | |
// | |
// var result = otherFunction(10); | |
// | |
// console.log(result); | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment