var arry = [ 64, 25, 12, 22, 11];

var quickestSortPossible = (a,n) => {
  for (var j = 0; j < n-1; j++) {
    var iMin = j;
    for (var i = j+1; i < n; i++) {
      if (a[i] < a[iMin] ) {
        iMin = i;
      }
    }
    if (iMin != j)
    {
      var b = a[j];
      a[j] = a[iMin];
      a[j] = b;
    }
  }
}

quickestSortPossible(arry,arry.length);