# How to Use STL Sort?

By now, the fastest comparison sorting algorithm is $$Ο(N\log N)$$. The sort() function in STL implemented with an optimized quicksort, which is always $$O(N\log N)$$.