notes < swap ( , , to get [ [ 'ovthere forel [ 'mvthere forer < swap ( , , to get [ [ 'uvl [ 'mv; break swap ( , , to get [ at this point 'nis in its correct place [ ] [ to [ constitutes sub list [ to [ constitutes sublist now quick sort ( quick sort ( the quick sort algorithm uses the ( log ncomparisons on average the performance can be improved by keeping in mind the following points switch to faster sorting scheme like insertion sort when the sublist size becomes comparatively small use better dividing element in the implementations we have always used [nas the dividing element useful method for the selection of dividing element is the median-of three method select any elements from the list use the median of these as the dividing element bucket sort bucket sort runs in linear time on the average it assumes that the input is generated by random process that distributes elements uniformly over the interval [ the idea of bucket sort is to divide the interval [ into equal-sized subintervalsor bucketsand then distribute the input numbers into the buckets since the inputs are uniformly distributed over ( )we don' expect many numbers to fall into each bucket to produce the outputsimply sort the numbers in each bucket and then go through the bucket in orderlisting the elements in each the code assumes that input is in -element array and each element in satisfies < [ < we also need an auxiliary array [ - for linked-lists (buckets lovely professional university