@Atlas Is this an '09 Emily post
i donāt think sheād know what a linked list is
What if sheād be forced to take informatics lessons
big mood sulit
whop up checking they node.next for null
Goblin
Really dumb idea, but couldnāt you just:
- Create three temp variables (weāll call them
current_node
,past_node
, andfuture_node
). - Save the first node to past_node, the second node to current_node, and current_node.next() to future_node.
- past_node.next() = None
- While current_node.next() != None:
- current_node.next() = past_node
- past_node = current_node
- current_node = future_node
- future_node = current_node.next()
- current_node.next() = past_node
called
Thereās probably a cleaner way of doing it, but this works.
im pretty sure my lecturers would make me just use some kind of horrifying for loop obelisk like a fucked up mutated shell sort
nintendo loop obelisk
youre compsci go away
youve probably actually done this already because you look at the binary and go waowg
I have done this already yeah I go waow based based based based based based based
imagine doing compsci thats some nerd shit
Reminds me of Tutuu tbh
im assuming u mean tutuu is a nerd, in which case i entirely agree
here in software dev we dont know how any of our cocde works and its better
Angy because Iām right uwu
TRUE