Stable and unstable sorting algorithms
Stable sorting algorithms preserve the relative order of equal elements, while unstable sorting algorithms don't.Most efficient sorting algo's
There are two which run in N*logN. Merge and Heap sort. N*logN is the most effiecient so far, given random variety of numbersWhy is segment tree used?
To update the value/values in array at an index and query the sum/max/... in the range of indices in O(log N)Big O cheatsheet: https://www.bigocheatsheet.com/