Question is to find the worst case time complexity of a brute-force algorithm for scheduling the talks by examining all possible subsets of talks.
Suppose we have $n$ talks that we want to schedule using greedy algorithm. There is a theorem which says that $n$ elements could give $2^n$ subsets. So, we have a combination of $2^n$ talks. Then we an compare $n\times(n-1)\times2^n$ pairs of talks and thus the worst-case complexity is $\mathcal{O}(n\times(n-1)\times2^n)$.
Each pair of talks in a subset have to be compared against each other to check for overlapping. There are $n$ talks and thu…