hw01Task

WEEK 01 3 ################## return 1 I ’ l l have 2 v a r i a b l e s one checking f o r the current node and the other checking by 2. So to speak , i f I ’m at node 2 my extra variable w i l l be at node 4. 2 3 slow=f a s t= L . head 4 while f a s t . next and f a s t . next . next : 5 f a s t=f a s t . next . next 6 slow=slow . next 7 slow . next 8 9 prev = None 10 current = slow . next 11 while ( current i s not None) : 12 next = current . next 13 current . next = prev 14 prev = current 15 current = next 16 head = prev 17 This algorithm f i n d s the h a l f kid and then s t a r t i n g from the kid in the middle i t r e v e r s e s the linked l i s t 18 I f I ’m not wrong about this , slow . next = head w i l l give me the new L. head with a l l students ordered and revered a f t e r the kid in the middle .