The time complexity of a binary search algorithm on a sorted list of size n is O(logn).
In binary search, each step reduces the search space by half. This halving behavior results in logarithmic time complexity. Binary search has a temporal complexity of O(logn), where n is the size of the sorted list.