Which of the following sorting algorithms is most efficient in terms of average-case time complexity?

  • Bubble Sort
  • Insertion Sort
  • Quick Sort
  • Selection Sort
Quick Sort is known for its efficiency in terms of average-case time complexity. It has an average-case time complexity of O(n log n) and is often faster than other sorting algorithms like Bubble Sort, Selection Sort, and Insertion Sort, which have worse average-case time complexities. Quick Sort's efficiency is achieved through a divide-and-conquer approach.
Add your answer
Loading...

Leave a comment

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