The running time is O ("n"²), but in practice the algorithm can run as fast as Insertion sort.
In practice the algorithm can run as fast as Insertion sort. The running time is O ("n"²).
The running time is O ("n"²). In practice the algorithm can run as fast as Insertion sort.
The running time is O ("n"²). In practice the algorithm can run as fast as Insertion sort.