Home/ Questions/Q 6667765
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-26T02:58:04+00:00

I recently read an article that talked about the computation complexity of algorithms. The

  • 0

I recently read an article that talked about the computation complexity of algorithms.
The author mentioned “why insertion sort is faster than quick-sort and bubble-sort for small cases”. Could anybody make some explanation for that?

Does anybody know the actual complexity of each sort algorithm I mentioned above?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Consider two complexity functions:

    F(X) = X^2
    G(X) = 4 * X * ln(X)

    F(3) = 9
    G(3) = 13

    So algorithm F wins for 3 items. But:

    F(100) = 10,000
    G(100) = 1,842

    So algorithm G wins for 100 items.

    Insertion sort’s complexity is like F(X). Quick sort’s complexity is like G(X).

    • 0