---
title: "Discussion on \"The performance cost of dynamic lists\" | Hashnode"
description: "Discussion on \"The performance cost of dynamic lists\". Why reference-based list are less performant"
url: "https://hashnode.com/posts/the-performance-cost-of-dynamic-lists/682e28e97b85bf91507f45ab"
---

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

Discussion

# [The performance cost of dynamic lists](https://tech.amanmulani.com/the-performance-cost-of-dynamic-lists?utm_source=hashnode&utm_medium=feed)

Why reference-based list are less performant

May 21, 2025 · 5 min read · tech.amanmulani.com  
Read the article

-   [#python](https://hashnode.com/tag/python)
-   [#performance-optimization](https://hashnode.com/tag/performance-optimization)
-   [#numpy](https://hashnode.com/tag/numpy)
-   [#python-internals](https://hashnode.com/tag/python-internals)

## Written by

[Aman Mulani](https://hashnode.com/@AmanMulani)

@AmanMulani

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

Software Engineer @ Clari

## Responses

Markdown supported · ⌘↵ to post

No responses yet.