Please solve this Q

Question

Q.  The best case of quick sort helps Aditya to sort a particular data set of size ‘n’ in 640 ms. Suresh also tried the same algorithm on similar data set and it took him 256 ms in best case to sort a file of size 16. What could be Aditya’s file size?

Comments

32,?

---

Please explain

Answer 1

When we say best case is n log n = nklogn where k it's constant

So 16 k log 16 = 256

So k will be 4

Thus n*4logn= 640

n log n = 160

N= 32