<s>
is	O
a	O
generic	O
construction	O
devised	O
by	O
Ken	O
Batcher	O
for	O
sorting	B-Algorithm
networks	I-Algorithm
of	O
size	O
O(n(logn )	O
2	O
)	O
and	O
depth	O
O((logn )	O
2	O
)	O
,	O
where	O
n	O
is	O
the	O
number	O
of	O
items	O
to	O
be	O
sorted	O
.	O
</s>
<s>
Although	O
it	O
is	O
not	O
asymptotically	O
optimal	O
,	O
Knuth	O
concluded	O
in	O
1998	O
,	O
with	O
respect	O
to	O
the	O
AKS	B-Algorithm
network	I-Algorithm
that	O
"	O
Batcher	O
's	O
method	O
is	O
much	O
better	O
,	O
unless	O
n	O
exceeds	O
the	O
total	O
memory	O
capacity	O
of	O
all	O
computers	O
on	O
earth	O
!	O
"	O
</s>
<s>
This	O
is	O
one	O
iterative	O
technique	O
to	O
generate	O
the	O
indices	O
for	O
sorting	B-Algorithm
n	O
elements	O
:	O
</s>
