akshar
what is the time complexity of an algorithm to merge 2 posted lists of size m and n ?

complexityakshar
what is the time complexity of an algorithm to merge 2 posted lists of size m and n ?
arch23
merge how?
AhmedSalmanJamal
It depends on the assortment technique ... however if thought linearly then the time complexity would be O(n)(m). akshar
I am not getting an expected answer
Related topics
