皮皮学，免费搜题
登录
搜题
【单选题】
《汤头歌诀》的作者是A.
B.
C.
D.
拍照语音搜题，微信中搜索"皮皮学"使用
参考答案：
参考解析：
知识点：
皮皮学刷刷变学霸
举一反三
【单选题】What are the Big-O Notations for array to insert or delete element and access element?
A.
O(n) O(n)
B.
O(n) O(1)
C.
O(1) O(n)
D.
O(1) O(1)
【判断题】There must be a collision if we insert a new element into a hash table with the loading density being 1.
A.
正确
B.
错误
【简答题】The time cost to insert one element into a sorted array is Θ(___) in average case.
【简答题】The time cost to insert or remove one element in a linear index is:
【单选题】To insert a data element in a linear structure data conveniently, the best data structure is ( ).
A.
Sequential storage
B.
Linked storage
C.
Index storage
D.
Hash storage
【简答题】分行制的优缺点是什么?
【简答题】The time cost to insert an element into an array based list is _________ in average case?
相关题目：