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


Chatonline
Hey, I'm Fabian 👋 What can I help you with?

Recent Notes

  • rescue-iso-ssh-pi-agent

    Jul 22, 2026

  • termux-ssh-mosh-zerotier

    Jul 22, 2026

  • Termux

    Jul 20, 2026

  • hyprland-noctalia-migration

    Jul 19, 2026

  • 2026-07-14-bret-fisher-gh-security.meeting

    Jul 17, 2026

See 439 more →

Graph View

Backlinks

  • Javascript

Created with Quartz v4.5.2 © 2026

  • Home
  • Notes
  • Contact