In a O(nlog?n) sorting algorithm, the log?n typically indicates the use of a _______ process.

  • Divide and Conquer
  • Linear
  • Parallel
  • Recursive
In a sorting algorithm with a time complexity of O(nlog?n), the log?n typically indicates the use of a 'Divide and Conquer' process, where the problem is split into smaller subproblems and solved recursively.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *