`org.apache.iceberg.util.SnapshotUtil#snapshotIdAsOfTime` could make use of binary search if `org.apache.iceberg.Table#history` is guaranteed to be ordered

[findinpath]

Currently the SnapshotUtil is going over all the history entries of a table (with O(n) complexity).

    Long snapshotId = null;
    for (HistoryEntry logEntry : table.history()) {
      if (logEntry.timestampMillis() <= timestampMillis) {
        snapshotId = logEntry.snapshotId();
      }
    }

In case that the org.apache.iceberg.Table#history would be guaranteed to be ordered, a binary search algorithm could be used instead (O(log n) complexity).

[RussellSpitzer]

Unfortunately I do not believe we are guaranteed that History is ordered (WAP commits) or Complete (History has a max length) so I do not believe we can rely on it. The only true way to view the lineage is the recursive approach being used.