Is O(n) better than O(log n) in terms of time complexity?

In terms of time complexity, O(log n) is better than O(n) because it has a faster rate of growth as the input size increases.