<s>
Binary	B-Algorithm
prioritization	I-Algorithm
is	O
a	O
sorting	B-Algorithm
algorithm	I-Algorithm
which	O
prioritizes	O
to-do	O
tasks	O
.	O
</s>
<s>
Unlike	O
other	O
Binary	B-Algorithm
Sort	I-Algorithm
methods	O
(	O
e.g.	O
</s>
<s>
binary	O
search	O
)	O
this	O
method	O
assumes	O
that	O
the	O
deferred	O
work	O
will	O
be	O
prioritized	O
in	O
a	O
later	O
process	O
,	O
but	O
their	O
order	O
is	O
not	O
relevant	O
in	O
the	O
first	O
iteration	B-Algorithm
.	O
</s>
<s>
The	O
faster	O
processing	O
of	O
classified	O
and	O
important	O
tasks	O
is	O
achieved	O
by	O
reducing	O
the	O
cost	O
of	O
sorting	B-Algorithm
by	O
not	O
sorting	B-Algorithm
the	O
subset	O
of	O
the	O
less	O
important	O
tasks	O
.	O
</s>
<s>
In	O
each	O
iteration	B-Algorithm
,	O
the	O
cost	O
is	O
reduced	O
by	O
the	O
sorted	O
elements	O
.	O
</s>
<s>
For	O
the	O
application	O
of	O
the	O
binary	B-Algorithm
prioritization	I-Algorithm
it	O
is	O
assumed	O
that	O
the	O
elements	O
to	O
be	O
prioritized	O
are	O
present	O
in	O
an	O
unsorted	O
heap	O
.	O
</s>
<s>
The	O
algorithm	O
of	O
the	O
binary	B-Algorithm
prioritization	I-Algorithm
is	O
as	O
follows	O
:	O
</s>
<s>
This	O
is	O
repeated	O
in	O
the	O
first	O
iteration	B-Algorithm
until	O
all	O
items	O
have	O
been	O
evaluated	O
into	O
two	O
new	O
stacks	O
(	O
or	O
lists	O
)	O
.	O
</s>
<s>
by	O
a	O
separator	B-Algorithm
.	O
</s>
<s>
The	O
algorithm	O
is	O
then	O
applied	O
in	O
an	O
additional	O
iteration	B-Algorithm
on	O
the	O
united	O
stack	O
up	O
to	O
the	O
separator	B-Algorithm
element	O
.	O
</s>
<s>
An	O
example	O
of	O
the	O
application	O
of	O
Binary	O
sorting	B-Algorithm
is	O
the	O
following	O
scenario	O
:	O
A	O
mail	O
inbox	O
has	O
to	O
be	O
sorted	O
and	O
important	O
mails	O
have	O
to	O
be	O
answered	O
first	O
,	O
no	O
matter	O
the	O
relative	O
importance	O
of	O
rather	O
unimportant	O
mails	O
.	O
</s>
