Loading video...
QuickNotes™ 
Sorting, Part II
Advance sort techniques are complicated and require more resources but they are much faster in most cases especially on large lists.
They mostly work on the principal of dividing the lists to smaller list and sorting the small lists and merging them.
Quick and merge sorts are 2 common algorithm used for fast sorting techniques.
The big O of advance sorts is usually around o(n log n ).
Discussion 
Please login to ask a question and view discussion.













