O(1) < O( log(n) ) < O(n) < O( n log(n) ) < O ( n2 ) < O ( 2n ) < O ( n!)

Having same average and worst case:

Having different average and worst case:

Heap Data Structure:

S – Sorted, US – Unsorted , Binary Heap Heapify – O (n)

Graph Data Structure: