What is the efficiency (big o notation) of quicksort algorithm?

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²).

the major difference between the two is the objective and the reward of the game. candy crush has a puzzle theme with the objective of meeting a specific quota of points or objects, you are able to gain access to the next level and compete with peers on the process. on duolingo the objective is rather different, you are given sets of questions for you to answer for you to move to the next level and as for the reward, you are able to learn available language as this is an app developed to teach the user about other languages.