hash - linear probing vs separate chaining in hashes -

i aware there's question this, question different.

i know sure searching using separate chaining o(n/m) , if sort lists o( log(n/m)).

however running time of searching or deleting using linear probing not clear me. far know load factor that's it.

additionally, when have cases full array (worst case), better use separate chain or linear probing?
if have sparse array, 1 choose well?

i can't seem figure out advantages of them on each other.

thank