data structures using if(loc==rightflag = else if( [loc]> [right]temp [loc] [loca[right] [righttemploc rightif(flag!= while(( [loc> [left]&(loc!=left)left++if(loc==leftflag = else if( [loc< [left]temp [loc] [loca[left] [lefttemploc leftreturn locvoid quick_sort(int []int begint endint locif(beg<endloc partition(abegend)quick_sort(abegloc- )quick_sort(aloc+ end) radix sort radix sort is linear sorting algorithm for integers and uses the concept of sorting names in alphabetical order when we have list of sorted namesthe radix is (or bucketsbecause there are letters in the english alphabet so radix sort is also known as bucket sort observe that words are first sorted according to the first letter of the name that is classes are used to arrange the nameswhere the first class stores the names that begin with athe second class contains the names with band so on during the second passnames are grouped according to the second letter after the second passnames are sorted on the first two letters this process is continued till the nth passwhere is the length of the name with maximum number of letters after every passall the names are collected in order of buckets that isfirst pick up the names in the first bucket that contains the names beginning with in the second passcollect the names from the second bucketand so on when radix sort is used on integerssorting is done on each of the digits in the number the sorting procedure proceeds by sorting the least significant to the most significant digit while sorting the numberswe have ten bucketseach for one digit ( and the number of passes will depend on the length of the number having maximum number of digts