banchmark__bigger_word_finder__for_or_loop.js

let times = 600000
let frase = "The quick red fox jumped over the lazy dog and ran away quickly";

function biggestWord(frase){
    let biggest = '';
    let words = frase.split(' ');
    for(let i=0; i < words.length; i++){
        if(words[i].length > biggest.length){
            biggest = words[i];
        }
    }
    return biggest
}


function getBigger(bigger, tail){
    if(tail[0].length > bigger.length){
        bigger = tail[0]
    }

    if(tail.length == 1){
        return bigger
    } else {
        return getBigger(bigger, tail.slice(1))    
    }
    
}


let timing1 = []
let bigger1 = ''
for(let i = 0; i < times; i++){
    t1 = performance.now()
    bigger1 = getBigger('', frase.split(' '))
    t2 = performance.now()
    timing1.push(t2 - t1)
}

let timing2 = []
let bigger2 = ''
for(let i = 0; i < times; i++){
    t1 = performance.now()
    bigger2 = biggestWord(frase)
    t2 = performance.now()
    timing2.push(t2 - t1)
}

let battle = {
    time1: {
        victories: 0,
        perc: 0
    },
    time2: {
        victories: 0,
        perc: 0
    },
    empate: {
        times: 0,
        perc: 0
    }
}
for(let i = 0; i < times; i++){
    if (timing1[i] < timing2[i]){
        battle.time1.victories++
    } else if (timing1[i] > timing2[i]){
        battle.time2.victories++
    } else {
        battle.empate.times++
    }
}

battle.time1.perc = (100 * battle.time1.victories)/times
battle.time2.perc = (100 * battle.time2.victories)/times
battle.empate.perc = (100 * battle.empate.times)/times

console.log('- - - - - - - -')
console.log('getBigger - recursive')
console.log(bigger1)
console.log('- - - - - - - -')
console.log('biggestWord - using for')
console.log(bigger2)
console.log('- - - - - - - -')
console.log('time battle')
console.log(battle)