* sorting time is O(n log n) both on average and worst-case. * * Typically, qsort is faster on average, but it suffers from exploitable * O(n*n) worst-case behavior and extra memory requirements that make it * less suitable for kernel use. */
source not stored for this graph (policy: none)