Which has faster time complexity: linear or logarithmic?

Logarithmic time complexity (e.g., O(log n)) executes faster than linear (O(n)) for large data volumes. This is because, with logarithmic complexity, the number of operations grows very slowly compared to the size of the input data, whereas with linear complexity, the number of operations grows proportionally to the input size.

For example, binary search has a complexity of O(log n), while simple linear search has a complexity of O(n). For large n, binary search will be significantly faster.