So, help our friend José, by writing a program that, in the most friendly way possible (José is an excellent writer, but is not an advanced computer user, though) does the next: * Counts the total of words in a news article, that must be entered by user. * Counts the total times each word appears in the article. * Sorts the words by number, most frequent ones must be at the top. * Show the results in a user-friendly way. All languages are welcome, I hope you have fun coding this one! :)

(by noobcoder)

"; } function openAnswer(){ closeNav(); document.getElementById("main").style.display="none"; document.getElementById("answer").style.display="block"; document.getElementById("task").style.display="none"; fadeIn(document.getElementById("answer")); } function fadeIn(el) { el.style.opacity = 0; var tick = function() { el.style.opacity = +el.style.opacity + 0.01; if (+el.style.opacity < 1) { (window.requestAnimationFrame && requestAnimationFrame(tick)) || setTimeout(tick, 16) } }; tick(); } function getResult(){ setTimeout(function(){ var str = $('#text').val(); $('#wordsTable').fadeIn(); var wordFreq = frequency(str); var wordCount = countWords(str); var uniqueWords = wordFreq.length; var summary = [ [ 'TOTAL WORDS', wordCount ], [ 'UNIQUE WORDS', uniqueWords ] ]; var table = toTable(wordFreq, ['Word', 'Frequency']); addRows(table, summary); $('#wordsTable').html(table); $('#author').fadeOut(); $("#author1").fadeIn(); },100); } function frequency(str) { return mapToSorted(wordMap(str), function(a, b, order) { if (b[1] > a[1]) { return order[1] * -1; } else if (a[1] > b[1]) { return order[1] * 1; } else { return order[0] * (a[0] < b[0] ? -1 : (a[0] > b[0] ? 1 : 0)); } }, [1, -1]); } function mapToSorted(map, sortFn, sortOrder) { return mapToWords(map).sort(function(a, b) { return sortFn.call(undefined, a, b, sortOrder); }); } function mapToWords(map) { return Object.keys(map).map(function(key) { return [ key, map[key] ]; }); } function wordMap(str) { return getWords(str).reduce(function(map, word) { map[word] = (map[word] || 0) + 1; return map; }, {}); } function getWords(str) { str=str.replace(/\,/g,' ') .replace(/\./g,' ') .replace(/\!/g,' ') .replace(/\?/g,' ') .replace(/\@/g,' ') .replace(/\:/g,' ') .replace(/\;/g,' ') .replace(/[{()}]/g,' '); return extractSubstr(str, /\b[a-z\d]+\b/g); } function extractSubstr(str, regexMatch) { return cleanString(str).match(regexMatch) || []; } function cleanString(str) { return str.replace(/[^\w\s]|_/g, '') .replace(/\s+/g, ' ') .toLowerCase(); } function countWords(str) { return getWords(str).length; } function toTable(data, headers) { return $('').append($('').append($('').append(headers.map(function(header) { return $('').append(data.map(function(row) { return $('').append(row.map(function(cell) { return $('').append(row.map(function(cell) { return $('

').html(header); })))).append($('
').html(cell); })); }))); } function addRows(table, data) { table.find('tbody').prepend(data.map(function(row) { return $('
').html(cell); })); })); return table; }

Challenge Words Counter