Expected time complexity is a measure of the average-case performance of an algorithm, indicating the amount of time it takes to run as a function of the input size, averaged over all possible inputs. It provides a more realistic performance assessment than worst-case time complexity, especially for algorithms with highly variable execution times depending on input distribution.