text
stringlengths
3
233
sort I-Algorithm
over O
the O
complete O
array B-Data_Structure
; O
because O
insertion B-Algorithm
sort I-Algorithm
's O
runtime O
is O
based O
on O
how O
far O
each O
element O
is O
from O
its O
final O
position O
, O
the O
number O
of O
comparisons O
remains O
relatively O
small O
, O
and O
the O
memory O
hierarchy O
is O
better O
exploited O
by O
storing O
the O
list O
contiguously O
in O
memory O
. O
</s>
<s>
Having O
single O
character O
names O
for O
single B-Device
instruction I-Device
, I-Device
multiple I-Device
data I-Device
( O
SIMD B-Device
) O
vector B-Data_Structure
functions O
is O
one O
way O
that O
APL B-Language
enables O
compact O
formulation O
of O
algorithms O
for O
data O
transformation O
such O
as O
computing O
Conway O
's O
Game O
of O
Life O
in O
one O
line O
of O
code O
. O
</s>
<s>
Compared O
to O
arrays B-Data_Structure
, O
linked B-Application
data I-Application
structures I-Application