data structtures

Question

complexity of  algorithm to interchange  the nth and mth element (node) of singly link list is:

a.m+n

b.m if m>=n otherwise n

c.m if m<=n otherwise n

d.m+min(m,n)

ans given c???????????how

Comments

Yes exactly answer should be B.

---

if you put O(max(m,n)) then a will also be correct right?

let N= n³  and M= n² 

Then O(M+N) also saying same b/c of big oh.

---

yes, A) is also right, but B) is more appropriate.