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

answer should be b), it will take O(max(m,n))

---

How????

---

to swap node m and n, firstly we have to travel farthest of m and n, which will take O(max(m,n)) , and then swapping can be done in O(1) time.

so overall, it will take -> O(max(m,n)) + O(1) = O(max(m,n))

---

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.