Ask Question
23 July, 11:21

What is the efficiency (Big O Notation) of quicksort algorithm?

+3
Answers (1)
  1. 23 July, 13:37
    0
    O (NlogN)

    Explanation:

    The time complexity of quick sort in worst case is O (N²) but the average case time complexity of quick sort is O (NLogN). The efficiency of quick sort totally depends upon the pivot. If the pivot is the smallest or the largest element in the array every time then the time complexity of quick sort algorithm will come out to be O (N²).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “What is the efficiency (Big O Notation) of quicksort algorithm? ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers