Old MathJax webview

Show how to sort the first 12 letters of your last name and first name (lowercase and in this order) using quicksort. If your last name and first name have in total less than 12 letters, append at the end the letters j, k, a, y, w, x.

Show the recursion tree, the pivot and the partition produced at each step of the quicksort algorithm.

Regarding the choice of the pivot, you are free to choose any item, as the randomized algorithm would do.

As a bonus, can you choose the pivot at each step so that the depth of the recursion tree is as small as possible?

Show how to sort the first 12 letters of your last name and first name (lowercase and in this order) using quicksort. If your last name and first name have in total less than 12 letters, append at the end the letters j, k, a, y, w, x.

For instance, in my case I would have to sort the sequence:  

m,i,c,h,a,e,l,s,m,i,t,h.

Show the recursion tree, the pivot and the partition produced at each step of the quicksort algorithm.

Regarding the choice of the pivot, you are free to choose any item, as the randomized algorithm would do.

As a bonus, can you choose the pivot at each step so that the depth of the recursion tree is as small as possible?