A fairly-stupid but actually very-effective recursive algorithm that I once encountered basically consisted of the following:

function populate(lo,hi, depth) {
  if (lo >= hi) return;
  if (depth > MAX_DEPTH) return;
  midpoint = rand(lo,hi);
  add_to_result(midpoint);
  populate(lo, midpoint-1, depth+1);
  populate(midpoint+1, hi, depth+1);
}
[download]