# Performance - Constant Time - O(1)

### Table of Contents

## About

A algorithm executes in constant time if no matter how large N is, it will always execute with the same latency (time).

In Big O notation, it performs as <math>O(1)</math>

## Example

A hashmap performs the IO operation get and put in constant time.