What is the time complexity of an algorithm that sorts an array of elements using a comparison-based sorting algorithm with a complexity of n log n?

1 answer

Answer

1276006

2026-04-09 23:45

+ Follow

The time complexity of sorting an array using a comparison-based sorting algorithm with a complexity of n log n is O(n log n).

ReportLike(0ShareFavorite

Copyright © 2026 eLLeNow.com All Rights Reserved.