self doubt

Question

https://gateoverflow.in/86225/gate1990-13b

for part a i think O(n^2) becz every tym we need to traverse whole chain.. ?

Comments

I MEAN SUPPOSE WE HAVE N ELEMENTS 10,20,30,40,..........................THEY ALL GOING TO SAME SLOT AND WE ARE GOING TO USE CHAINING SO 10 GOING TO A SLOT  NO TRAVERSING TO LINK IT NOW FOR 20 WE NEED TO TRAVERSE  THROUGH 10 TO PLACE 20 SIMILARY WE NEED TO PASS 10 ,20 TO PLACE 30 AND SO ON SO TOTAL WE ARE GETTING  1+2+3+..............N =O(N^2).....

---

we can just insert at the beginning of linked list each time if all n elements are in satisfying the same slot. why we need to pass 10 for inserting 20...nowhere in question mentioned about sorting!

---

OK GOT IT THANK U SO MUCH