Question

Suppose S is the following list of 14 alphabetic characters

S: D A T A S T R U C T U R E S

Find final positions of each alphabets using Quick sort algorithm. Sort S to S1.

S1: A A C D E R R S S T T T U U

Why average case of running complexity is F(n)= O(nlogn)? Justify your answer
​

Answer 1

qazxcvbnmlpoiuytrewsdfghjk