Analysis of Open Addressing

Let n be the number of elements in the table,
m is the size of the table.

n $\leq$ m

$\alpha$ = n/m $\leq$ 1

Assume uniform hashing (each sequence is equally likely).