What is the lower bound for the worst-case time complexity of any comparison-based sorting algorithm?

Ω(n log n)

This lower bound is derived from the decision tree model, which shows that a tree with n! leaves must have a height of at least log(n!). Using Stirling's approximation, this simplifies to n log n.