The time complexity of brute-force searching for the optimal split point in a decision tree is O(n·m·log n), where n is the number of samples and m is the number of features, and this is the main bottleneck in decision tree training speed.