שאלה 4 סעיף 5 בתרגיל

25 views
Skip to first unread message

ohad shai

unread,
Dec 3, 2012, 2:42:40 AM12/3/12
to algorithms-in-...@googlegroups.com
Hi Edo,
Regarding question 4.5
Can we have some lead to the formal proof?
intuitively, I think that add/query functions are o(1) because we are using pure hash functions, which means there should not be collisions in add. means we are expected to use about only 1 hash function.
Thanks,
Ohad.

Edo Liberty

unread,
Dec 3, 2012, 8:26:08 AM12/3/12
to algorithms-in-...@googlegroups.com
I'm not sure what you mean by that...
Should we try to talk after class?



From: ohad shai <ohad...@gmail.com>
To: algorithms-in-...@googlegroups.com
Sent: Monday, December 3, 2012 9:42 AM
Subject: [algorithms-in-data-mining-tau] שאלה 4 סעיף 5 בתרגיל
Reply all
Reply to author
Forward
0 new messages