Arrays proven once again the ultimate data structure

https://jackmott.github.io/programming/2016/08/20/when-bigo-foolsya.html
Bonus:For loops are faster by considerable margin than everything else.

>>40
Badly impersonating Cudder is a bad meme.

>>5
Yeah, why does memory have to be an array of bits? I want a linked list of bits instead.

>>42
Like a CCD based RAM?

>>42
link the array of bits in any order you like using another array of bits
Bonus: you can control the bitsize of the link indices
only need 255 elements or less? use 8 bit ints for your index array!

How big are pointers anyway? is there a minimum chunk of memory that they refer to?

Noone built the holy-grail sort yet?
Its supposed to be in-place O(n*log(n))

Quickersort() using arraylinks?

quicksort has a chunk-style item reordering segment (3n / 2) read-[compare]-write op's

quickersort with comparison trees? possibly (2n / 2)? read-compare-compare-write ? Possible to change pivot points 0-n-1 times through an n-iteration?

arraylink insert: n-chain inplace insert costs n+1 ?

Lispers have discovered that you can compress a linked list by turning it into an array:

https://en.m.wikipedia.org/wiki/CDR_coding

>>46
also unrolled linked lists are cool