Fabian
Untermoser

Freelance Full-stack Developer · MSc

NotesContact
Home

❯

Notes

❯

dev

❯

Javascript Performance

Mar 08, 20251 min read

Javascript Performance

Data Structures

  • Prefer sorted array for O(n log n).

Engine Optimizations

Slow (HashTable):

{
    '1': 10,
    '2': 20,
    '3': 30,
}

Faster (Array):

{
    '0': 10,
    '1': 20,
    '2': 30,
}

Changing the index to ‘0’ is faster because the array implementation is faster than HashTable.

Source: Fast By Default: Algorithmic Performance Optimization in Practice


AI AssistantAI
Hi! I'm an AI assistant that answers based on Fabian's public content. What can I help you with?

Recent Notes

  • screen

    Sep 25, 2026

  • termux-ssh-mosh-zerotier

    Sep 25, 2026

  • Notes

    Sep 25, 2026

  • My Home Lab Journey

    Sep 24, 2026

  • SolarAssets

    Sep 24, 2026

See 441 more →

Graph View

Backlinks

  • Javascript

Created with Quartz v4.5.2 © 2026

  • Home
  • Browse Notes
  • Get in touch
  • Legal