Big-O Complexities: of Common Algorithms Used in Computer Science

BIG-O COMPLEXITIES
OF COMMON ALGORITHMS USED IN COMPUTER SCIENCE

DATA
STRUCTURE
OPERATIONS
Data Structure
Time Complexity
Average
Search
Array
O (1)
O (n)
O (n)
Stack
O (n)
O (n)
Singly-Linked List
O (n)
Doubly-Linked List
Skip List
Cartesian Tree
O (n)
O (1)
O (n)
O (n)
O (n)
O (n)
O (1)
O (1)
O (n)
O (n)
O (1)
O (1)
O (n)
O (n)
O (1)
O (1)
O (n)
O (n)
O (1)
O (1)
O (n)
O (n)
O (n)
O (1)
O (1)
O (n)
O (n)
O (1)
O (1)
O (n)
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
O (n)
O (n)
O (n)
O (n lo g (n))
O (1)
O (1)
O (1)
O (n)
O (n)
O (n)
O (n)
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
O (n)
O (n)
O (n)
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
O (n)
O (n)
O (n)
O (n)
Insertion
Deletion
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
Red-Black Tree
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (n)
AVL Tree
O (l o g (n))
Algorithm
O (l o g (n))
Time Complexity
Space Complexity
Best
Average
Worst
Worst
Quicksort
O (n l o g (n))
O (n lo g (n))
O (n^2)
O (l o g (n))
Mergesort
O (n l o g (n))
O (n lo g (n))
O (n lo g (n))
O (n)
Timsort
O (n)
O (n lo g (n))
O (n lo g (n))
O (n)
Heapsort
O (n l o g (n))
O (n lo g (n))
O (n lo g (n))
O (1)
G oo d
Bubble Sort
O (n)
O (n^2)
O (n^2)
O (1)
Fa ir
Insertion Sort
O (n)
O (n^2)
O (n^2)
O (1)
Bad
Selection Sort
O (n^2)
O (n^2)
O (n^2)
O (1)
Shell Sort
O (n)
O ((nl o g (n))^2)
O ((nl o g (n))^2)
O (1)
Bucket Sort
O (n+k)
O (n+k)
O (n^2)
O (n)
Radix Sort
O (nk)
O (nk)
O (nk)
O (n+k)
Node / Edge Management
Storage
Add Vertex
Add Edge
LEGEND
E xce ll e nt
H o rrib l e
Remove Vertex
Remove Edge
Query
Adjacency list
O (| V |+| E|)
O (1)
O (1)
O (| V |+| E|)
O (| E|)
O (| V |)
Incidence list
O (| V |+| E|)
O (1)
O (1)
O (| E|)
O (| E|)
O (| E|)
Adjacency matrix
O (| V |^2)
O (| V |^2)
O (1)
O (| V |^2)
O (1)
O (1)
Incidence matrix
O (| V | | E|)
O (| V | | E|)
O (| V | | E|)
O (| V | | E|)
O (| V | | E|)
O (| E|)
Heap Type
Time Complexity
Heapify
Find Max
Extract Max
Increase Key
Insert
Delete
Merge
Linked List (sorted)
O (1)
O (1)
O (n)
O (n)
O (1)
O (m+n)
Linked List (unsorted)
O (n)
O (n)
O (1)
O (1)
O (1)
O (1)
O (1)
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (l o g (n))
O (m+n)
Binary Heap
O (n)
Binomial Heap
O (1)
O (l o g (n))
O (l o g (n))
O (1)
O (l o g (n))
O (l o g (n))
Fibonacci Heap
O (1)
O (l o g (n))
O (1)
O (1)
O (l o g (n))
O (1)
1000
900
800
O(1)
700
O(logn)
Operations
BIG-O
COMPLEXITY
CHART
Deletion
B-Tree
Splay Tree
HEAP
OPERATIONS
Search
O (l o g (n))
Insertion
Worst
Access
Binary Search Tree
GRAPH
OPERATIONS
Worst
Access
Hash Table
ARRAY
SORTING
ALGORITHMS
Space Complexity
600
O(n)
500
O(nlogn)
O(n^2)
400
O(2^n)
300
O(n!)
200
100
0
0
10
20
30
40
50
Elements
60
70
80
90
100
WWW.BIGOPOSTER.COM
2016 Roman Pushkin

Big-O Complexities: of Common Algorithms Used in Computer Science

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Big-O Complexities: of Common Algorithms Used in Computer Science

Transféré par

Droits d'auteur :

Formats disponibles

BIG-O COMPLEXITIES

OF COMMON ALGORITHMS USED IN COMPUTER SCIENCE

Node / Edge Management

Linked List (sorted)

Linked List (unsorted)

Binary Search Tree

Vous aimerez peut-être aussi