Priority queue complexities

Implementation Insert Del max Max

Unordered array 1 N N
Ordered array N 1 1
Binary heap Logn 2logn 1
D ary heap Logdn Dlogdn 1
Quick Unions
Algorithm Worst case
Quick-find MN
Quick-union MN
Weighted qu n
Qu+path compression N+MlogN
Weighted QU + path compression N+Mlg*N
Graphs
Representation Space Add edge Is adjacent to Iterate adjacent
vertex v to v
List of edges E 1 E E
Adjacency matrix V^2 1 1 V
Adjacency list E+v 1 Degree(v) Degree(v)

Binary Heap:
Insert: worst case 1+logN
Delete Max: Wors 2lgN
D-ary Heap:
Insert: logdN del max: dlogdN max 1
Delete w/ tombstone: cost is 2lnM per insert search & delete
Heapsort:
nlogn worst case. Optimal for time and space, in place sort
Quicksort -> binary search tree
Heapsort -> binary heap tree
BST:
Insert, search, del: 2lnM
Kurskal’s algorithm: eloge e = edge
Prim’s algorithm: lazy: eloge eager: elogv
2-3 trees best case height: log2n worst: log3n
Dijkstra’s time: elogv space: v