Performance - Constant Time - O(1)

Sorting Quicksort Anim

Performance - Constant Time - O(1)

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.




Discover More
Sorting Quicksort Anim
Algorithm - Complexity (Big O)

Complexity is based off of how the algorithm scales for very large n. Constants and lower-order terms are dropped. For example: will execute in constant time a model that takes time has complexity,...
Data System Architecture
Collection - HashMap (Hash table)

A hash map is an implementation of a map that stores the data in buckets. The distribution of the data to a bucket is via the hash value of the key map entry (hence a HashMap). A hash map is used...



Share this page:
Follow us:
Task Runner