O(1) < O( log(n) ) < O(n) < O( n log(n) ) < O ( n2 ) < O ( 2n ) < O ( n!)
Having same average and worst case:
Note: It takes O(1) only when the pointer is given to where the insertion or deletion is to be made in the linked list otherwise first the location where insertion or deletion has to be done is to be found out which might take O(n) time.
Having different average and worst case:
Heap Data Structure:
S – Sorted, US – Unsorted , Binary Heap Heapify – O (n)
Graph Data Structure: