T9 blogpost - 5

gistfile1.js

function insertWordIntoListByFrequency(list, word, useFrequency) {
  var wordToInsert = [word, useFrequency]; // Store word in a tuple.
  var wordsLength = list.length;

  if(wordsLength === 0) {
    // Handle the case where this node has no words yet
    list.push(wordToInsert);
  } else {
    // Find where to insert this word among others, based on its 
    // frequency property.
    // todo: this could be faster with binary search.
    for(var i = 0; i < wordsLength; i++) {
      var comparedFrequency = list[i][1];
      var insertFrequency = wordToInsert[1];

      if(insertFrequency >= comparedFrequency) {
        // If i see a word with lower useFrequency than mine, 
        // insert before it.
        list.splice(i, 0, wordToInsert);
        return;
      }
    }
    // If we've reached here, we've looked at the last word on this node 
    // and our word's frequency is less than it. 
    // Put my word at the end of the list.
    list.splice(i + 1, 0, wordToInsert);
  }
}