Enabling AI algorithms to scale by reducing the exponential increase of execution time or space requirements as the size of the input increases. For example, An algorithm with quadratic time complexity has poor scalability: if you increase the size of the input by 10 times, the time increases by 100 times. In fact, the time complexity of Th (n log n) is very close to linear: It takes about twice as long to solve a problem of twice the size.