Shor's algorithm in quantum computing

Quantum algorithms are far much better than classical algorithms because they are based on Quantum Fourier Transform.

Run time on the classical computer is O[exp (L1/3(log L)2/3)] but that on the quantum computer is O(L3).

So, Shor’s Algorithm in principle, shows that a quantum computer is capable of factoring very large numbers in polynomial time.