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

1.	Why is the complexity of fetching from an Array be O(1)?
Answer» 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]) + i*size(object) This term is independent of n, so the time complexity of fetching from an Array is O(1).

Answer»

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]) + i*size(object)

This term is independent of n, so the time complexity of fetching from an Array is O(1).

Discussion

No Comment Found

Related InterviewSolutions

How to check the equality of two arrays?
How do you merge two sorted arrays into one sorted array?
How can you get the index of an array element?
How do you remove a particular element from an array?
How do you find the missing integer in an array of range 1 to 100?
Why is the complexity of fetching from an Array be O(1)?
Compare Arrays with Linked Lists.
What do you mean by the terms “Dimension” and “Subscript” when we talk about arrays?

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

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment