Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Child

Name: Anonymous 2011-11-01 22:22

Is there a way to combine an ArrayLists get performance with a LinkListed add performance?

Name: Anonymous 2011-11-01 22:46

python

Name: Anonymous 2011-11-01 22:54

Yes

Name: Anonymous 2011-11-01 23:54

>>2
You keep saying that word. I do not think it means what you think it means.”

Name: Anonymous 2011-11-02 6:29

>>4
Go back to the imageboards.

Name: fuck you faggot 2011-11-02 10:19

>>5
mailto:noko

Name: Anonymous 2011-11-02 11:16

Might I ask a question? If you don't mind, why is this thread called "Child"?.

If you do mind, please do not read spoiler.

Name: Anonymous 2013-12-13 14:03

u mad?

Name: Anonymous 2013-12-13 14:14

>>7
bait for saging pedos like yourself obviously

Name: Anonymous 2013-12-13 14:54

Someone explain why ``sage'' has anything to do with pedophilia.

Name: Anonymous 2013-12-13 18:11

>>10
>le pedophile sage

Name: Cudder !MhMRSATORI!fR8duoqGZdD/iE5 2013-12-14 7:06

>>7
It's a subtle hint at the solution. Something branchy... and that has children.

Name: 2013-12-16 15:23

Name: Anonymous 2013-12-16 19:54

>>12
That nets you O(log(n)) lookups and O(log(n)) insertions, not O(1) lookups (array) or O(1) insertions (linked list).

>>1
Use a fucking huge list

More seriously, Java's ArrayList intentionally overallocates space so that it doesn't have to keep reallocating for each add. The performance impact of that is negligible.

Name: Anonymous 2013-12-18 8:21

>>1

You either want an array or a linked list, here's how to make a choice.

Do you want to often add items to the front *and* end of a sequence, and you do not require random access? If yes, use a doubly linked list. Do you want to use immutable sequences of data which can be grown from sub-seqeunces? If yes, use a singly or doubly linked list. At all other times, use an array.

Don't change these.
Name: Email:
Entire Thread Thread List