logo

Why is the complexity of fetching from an Array be O(1)?

Why is the complexity of fetching from an Array be O(1)?

题目类型: 技术面试题

这是一道技术面试题,常见于澳洲IT公司面试中。

难度: hard

标签: interviewbit, array, topic-specific, arrays, data-structures

参考答案摘要

In an Array, objects are stored in continuous memory location. So, if you know the address of the base object then you will be able to find the address of the ith object. address(a[i]) = address(a[0])...

本题提供 STAR 原则详细解答和技术解析,登录匠人学院学习中心即可查看完整答案。

← 返回面试题库

Why is the complexity of fetching from an Array be O(1)?

Hardarraysdata-structures

想查看完整答案?

登录匠人学院学习中心,获取 STAR 格式回答和详细技术解析

前往学习中心查看答案