data structures and algorithms, question is below

Q2 Consider the following array S: Write an algorithm to sort array S using the following scenario and find the time complexity of sorting with respect to given S. Select a specific element x from S L, storing the elements in S less than x E, storing the elements in S equal to x G, storing the elements in S greater than x Recursively sort sequences L and G and Put back the elements into S in order by first inserting the elements of L, then those of E, and finally those of G