average probe length unsuccessful successful figure load factor quadratic-probe and double-hashing performance this is the same as the definition of the load factorloadfactor arraysize so the average list length equals the load factor searching in successful searchthe algorithm hashes to the appropriate list and then searches along the list for the item on the averagehalf the items must be examined before the correct one is located thusthe search time is loadfactor this is true whether the lists are ordered or not in an unsuccessful searchif the lists are unorderedall the items must be searchedso the time is loadfactor