Made Easy Test Series: Algo- Mathematical Solution

Question

Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the number of comparisons?

---

will it be $\left ( 5000 \right )^{2}$ or $\left ( 5000 \right )\times 4$. Someone check plz

Comments

The answer will be (5000)×4.

# Of Comparison = O(n^2) so ,

5000 = C (k^2) [Where C is asymptotic constant ]

so C= 5000 / (k^2)

Now if we double the element so n=2k

# Of Comparison = C [(2k)^2]

                            = 4 * C * (k^2)

                            = 4 * [5000 / (k^2)] * (k^2)

                            = 4*5000

Answer 1

The answer will be (5000)×4.

# Of Comparison = O(n^2) so ,

5000 = C (k^2) [Where C is asymptotic constant ]

so C= 5000 / (k^2)

Now if we double the element so n=2k

# Of Comparison = C [(2k)^2]

                            = 4 * C * (k^2)

                            = 4 * [5000 / (k^2)] * (k^2)

                            = 4*5000

Comments

Answer is 5000*4

---

Yes it is 4*5000