function insertionSort(arr) {
  var i, j, value;
  for (i = 0; i < arr.length; i++) {
    value = arr[i];
    j = i - 1;
    while (j >= 0 && arr[j] > value) {
      arr[j + 1] = arr[j];
      j = j - 1;
    }
  }
  return arr;
}
 
var a = [ { "value": 3 }, { "value": 1 }, { "value": 2 } ];
insertionSort(a);