---
title: "Discussion on \"The Pointer Arithmetic of Constant Time: Why Arrays Scale O(1)\" | Hashnode"
description: "Discussion on \"The Pointer Arithmetic of Constant Time: Why Arrays Scale O(1)\". Constant-time array access isn't magic. It's just pointer arithmetic on contiguous memory: start + (index * size). Here is why O(1) doesn't care about size."
url: "https://hashnode.com/posts/the-pointer-arithmetic-of-constant-time-why-arrays-scale-o-1/69a9b1df3728a9dc3593ea42"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [The Pointer Arithmetic of Constant Time: Why Arrays Scale O(1)](https://doogal.dev/the-pointer-arithmetic-of-constant-time-why-arrays-scale-o-1?utm_source=hashnode&utm_medium=feed)

Constant-time array access isn't magic. It's just pointer arithmetic on contiguous memory: start + (index \* size). Here is why O(1) doesn't care about size.

Mar 5 · 5 min read · doogal.dev  
Read the article

-   [#computerscience](https://hashnode.com/tag/computerscience)
-   [#datastructures](https://hashnode.com/tag/datastructures)
-   [#softwareengineering](https://hashnode.com/tag/softwareengineering)
-   [#performance](https://hashnode.com/tag/performance)
-   [#lowlevel](https://hashnode.com/tag/lowlevel)

## Written by

[Doogal Simpson](https://hashnode.com/@doogal)

@doogal

  
[View profile](https://hashnode.com/@doogal)

"hey doogal, what is .... ?"

## Responses

Markdown supported · ⌘↵ to post

No responses yet.