ANY OF U REDDY 2 CHALLENGE ME YET?

CARN

>>18
Even if the array needs to be resized several times, the difference between O(1) and O(n) is huge.
TELL ME, WHAT DA FUCK ARE DESE GROWTH RATES MEANT TO REPRESENT?

>>18
Most often you walk across the whole list instead of random access you faglord.

>>25
I'LL ASSUME U MEANT TO REFERENCE MY POST.

ANYWAY, NOW UR BEING A BIT LESS VAGUE. OKAY, LET'S ANALYSE MY PROGRAM A BIT, SHALL WE? WE'LL TAKE A LOOK AT DA VARIOUS OPERATIONS WE DO ON DESE LINKED LISTS. WE'LL LOOK AT DIS LINK: http://ideone.com/S9BEkQ

OK, THE OPERATION WE SEE ON LINE 35 IS AN INSERTION OPERATION. WE INSERT TO DA FRONT OF DA LIST. PRETTY FUCKIN COOL. LOOKS LIKE DAT HAS A GROWTH RATE OF O(1). PRETTY FUCKIN SNAZZY HUH?

OK, THE NEXT OPERATION, ON LINE 39, IS A TRAVERSAL. O(n), BUT DATS DA SAME AS IT IS FOR AN ARRAY. U EVER SEE ANYONE TRAVERSE AN ARRAY IN UNDER O(n)? I HAVEN'T. GOTTA BE FUCKIN SUPERMAN TO DO DAT SHIT, RIGHT?

GOT A PROBLEM WITH O(1) INSERTION? GOT A PROBLEM WITH O(n) TRAVERSAL? DON'T THINK SO. SO WATS UR NEXT COMPLAINT ABOUT LINKED LISTS, YA RETOID?