BinaryByter
wikipedia
Unknown
Just scroll to it until you get a match
no its not the way how do I know what is the element in the middle, sorry I my question is different, it says that how do I get to the middle element of linked list and not searching an element.
BinaryByter
no its not the way how do I know what is the element in the middle, sorry I my question is different, it says that how do I get to the middle element of linked list and not searching an element.
scan through it until you are at the size » 2'th element
Ariana
^
MᏫᎻᎯᎷᎷᎬᎠ
no its not the way how do I know what is the element in the middle, sorry I my question is different, it says that how do I get to the middle element of linked list and not searching an element.
Hit a counter with 0 and a temp Node that runs through the elements while increasing counter with(++) until it gets to the last element
So counter is the size right now
Now do this
counter /=2
and bomm
BinaryByter
BinaryByter
please
BinaryByter
no more /2
BinaryByter
you speak the language of "I want my code to be slower than it could be"
MᏫᎻᎯᎷᎷᎬᎠ
It's linked list remember?!
MᏫᎻᎯᎷᎷᎬᎠ
O(N)
BinaryByter
kek
BinaryByter
why is everybody i'm telling not to bloat their code referring to O notation?
Unknown
Unknown
BinaryByter
Unknown
no
why? We traverse the linked list 2 times in the first case and only one time in the second case
BinaryByter
You should keep track of how many elements the list has somewhere else
Unknown
You should keep track of how many elements the list has somewhere else
but this is not required in method 2
BinaryByter
but this is not required in method 2
method 2 is still slower than just scanning with one pointer
BinaryByter
Yes, if you can't know how many elements you have in it
you should design your linked list to
Ariana
tbh linked lists usually worse in terms of memory consumption than arrays
Unknown
I am unable to understand
BinaryByter
tbh linked lists usually worse in terms of memory consumption than arrays
they have other design requirements
Mat
And a linked list doesn't have that counter by default
Ariana
vanilla linked list is jus a pointer to next element
Ariana
So its O(n)
Ariana
its crappy
BinaryByter
yes
BinaryByter
but it has quick insertion
BinaryByter
which might be what you want
BinaryByter
And a linked list doesn't have that counter by default
you must live in the past century where C was the only option then
BinaryByter
any good implementation should feature the counter
Unknown
BinaryByter
Unknown
Parra
do may mean memory fragmentation maybe?
Ariana
Like space used
Parra
Parra
i didn't thought about that before
BinaryByter
i didn't thought about that before
because its kinda useless when you keep track of the amount of elements
BinaryByter
its just one pointer operation more
BinaryByter
two, in fact
BinaryByter
per cycle
Parra
findMiddle can seg fault, no?
BinaryByter
why would it?
BinaryByter
unless you badly fill your pointers
Parra
no, it won't
Parra
you are right
Parra
comic Sans is fun
Parra
😄
BinaryByter
xD
BinaryByter
this isnt comic sans
BinaryByter
its even worse
Dima
olli
https://youtu.be/YQs6IC-vgmo
BinaryByter
in general