<s>
The	O
Huntington	B-Algorithm
–	I-Algorithm
Hill	I-Algorithm
method	I-Algorithm
is	O
a	O
method	O
for	O
proportional	O
allocation	O
of	O
the	O
seats	O
in	O
a	O
representative	O
assembly	O
by	O
minimizing	O
the	O
percentage	O
differences	O
in	O
the	O
number	O
of	O
constituents	O
represented	O
by	O
each	O
seat	O
.	O
</s>
<s>
Edward	O
Huntington	O
formulated	O
this	O
approach	O
,	O
building	O
on	O
the	O
earlier	O
work	O
of	O
Joseph	O
Adna	O
Hill	O
,	O
and	O
called	O
it	O
the	O
method	B-Algorithm
of	I-Algorithm
equal	I-Algorithm
proportions	I-Algorithm
.	O
</s>
<s>
When	O
envisioned	O
as	O
a	O
proportional	O
electoral	O
system	O
,	O
it	O
is	O
effectively	O
a	O
highest	B-Algorithm
averages	I-Algorithm
method	I-Algorithm
of	O
party-list	O
proportional	O
representation	O
in	O
which	O
the	O
divisors	O
are	O
given	O
by	O
,	O
n	O
being	O
the	O
number	O
of	O
seats	O
a	O
state	O
or	O
party	O
is	O
currently	O
allocated	O
in	O
the	O
apportionment	O
process	O
(	O
the	O
lower	O
quota	O
)	O
and	O
is	O
the	O
number	O
of	O
seats	O
the	O
state	O
or	O
party	O
would	O
have	O
if	O
it	O
is	O
assigned	O
to	O
the	O
party	O
list	O
(	O
the	O
upper	O
quota	O
)	O
.	O
</s>
<s>
In	O
a	O
legislative	O
election	O
under	O
the	O
Huntington	B-Algorithm
–	I-Algorithm
Hill	I-Algorithm
method	I-Algorithm
,	O
after	O
the	O
votes	O
have	O
been	O
tallied	O
,	O
the	O
qualification	O
value	O
would	O
be	O
calculated	O
.	O
</s>
<s>
After	O
all	O
qualified	O
parties	O
or	O
states	O
received	O
their	O
initial	O
seats	O
,	O
successive	O
quotients	O
are	O
calculated	O
,	O
as	O
in	O
other	O
Highest	B-Algorithm
Averages	I-Algorithm
methods	I-Algorithm
,	O
for	O
each	O
qualified	O
party	O
or	O
state	O
,	O
and	O
seats	O
would	O
be	O
repeatedly	O
allocated	O
to	O
the	O
party	O
or	O
state	O
having	O
the	O
highest	O
quotient	O
until	O
there	O
are	O
no	O
more	O
seats	O
to	O
allocate	O
.	O
</s>
<s>
Unlike	O
the	O
D'Hondt	B-Algorithm
and	O
Sainte-Laguë	B-Architecture
systems	O
,	O
which	O
allow	O
the	O
allocation	O
of	O
seats	O
by	O
calculating	O
successive	O
quotients	O
right	O
away	O
,	O
the	O
Huntington	O
–	O
Hill	O
system	O
requires	O
each	O
party	O
or	O
state	O
have	O
at	O
least	O
one	O
seat	O
to	O
avoid	O
a	O
division	B-Algorithm
by	I-Algorithm
zero	I-Algorithm
error	I-Algorithm
.	O
</s>
<s>
In	O
this	O
example	O
,	O
the	O
results	O
of	O
the	O
apportionment	O
is	O
identical	O
to	O
one	O
under	O
the	O
D'Hondt	B-Algorithm
system	I-Algorithm
.	O
</s>
<s>
However	O
,	O
as	O
the	O
District	O
magnitude	O
increases	O
,	O
differences	O
emerge	O
:	O
all	O
120	O
members	O
of	O
the	O
Knesset	O
,	O
Israel	O
's	O
unicameral	O
legislature	O
,	O
are	O
elected	O
under	O
the	O
D'Hondt	B-Algorithm
method	I-Algorithm
.	O
</s>
<s>
Had	O
the	O
Huntington	B-Algorithm
–	I-Algorithm
Hill	I-Algorithm
method	I-Algorithm
,	O
rather	O
than	O
the	O
D'Hondt	B-Algorithm
method	I-Algorithm
,	O
been	O
used	O
to	O
apportion	O
seats	O
following	O
the	O
elections	O
to	O
the	O
20th	O
Knesset	O
,	O
held	O
in	O
2015	O
,	O
the	O
120	O
seats	O
in	O
the	O
20th	O
Knesset	O
would	O
have	O
been	O
apportioned	O
as	O
follows	O
:	O
</s>
