This notation is used mention the complexity of algorithms in data structure and algorithms.
For example like sorting, merging, encoding, decoding etc
It helps to compare two different algorithms which gives same results ; by comparing their complexity.
For average case
Heap Sort : O(nLog(n))
Bubble Sort: O(n*n)
Where n is the number of elements in the list.
So heap sort is the best compared to bubble sort J
eguru