-小钢琴家-# Parenting - 为人父母
j*y
1 楼
clrs 上 11.1 的一道题
Suggest how to implement a direct-address table in which the keys of stored
el-
ements do not need to be distinct and the elements can have satellite data.
All
three dictionary operations (INSERT, DELETE, and SEARCH) should run in O(1)
time. (Don’t forget that DELETE takes as an argument a pointer to an object
to be deleted, not a key.)
要用 O(1) time的话应该不是用 chaining 吧。
Suggest how to implement a direct-address table in which the keys of stored
el-
ements do not need to be distinct and the elements can have satellite data.
All
three dictionary operations (INSERT, DELETE, and SEARCH) should run in O(1)
time. (Don’t forget that DELETE takes as an argument a pointer to an object
to be deleted, not a key.)
要用 O(1) time的话应该不是用 chaining 吧。