In 1950s a number of methods for circuit minimization for Boolean functions have been invented. Is there an extension of those methods or anything similar for optimising time or space complexity of algorithms?For example an implementation of bubble sort as an input for such an algorithm would produce an implementation of a sorting algorithm with time complexity closer to $O(n\log n)$.
Is there an algorithm for algorithms time/space complexity optimisation?
algorithms;turing machines;time complexity;optimization;space complexity