The worst-case time complexity of the binary search is O(log n), where n is the size of the data set. This means that the search time grows logarithmically with the size of the data, making it highly efficient.