notes ++ifi jinterchange(& [ ]& [ ])interchange(& [ ]& [ ])qsort(xmj- )qsort(xj+ )void interchange(int *iint *jint temptemp * * * * tempchoice of the key we can choose any entry in the list as the key the choice of first entry is often poor choice for keysince if the list is already sortedthen there will be no element less than the first element selected as keyand so one of the sub-lists will be empty hence we choose key near the center of the listin the hope that our choice will partition the list in such manner that about half comes on each side of key therefore the function getkeyposition isint getkeyposition(int iint jreturn( + mod )the choice of the key near the center is also arbitraryand hence it is not necessary that it will always divide the list nicely in to halfit may also happen that one sub-list is much larger than other hence some other method of selecting key should be used good way to choose key is to use random number generator to choose the position of next key in each activation of quicksort therefore the function getkeyposition isint getkeyposition(int iint jreturn random number in the range of to consider the following list lovely professional university indices