Abstract
We examine in detail the asymptotic behaviors of the number of comparisons used in Batcher's sorting algorithm and a quantity arising in analyzing the rectangle heuristic for finding minimum Euclidean matching due to Supowit and Reingold. We put forth methods (elementary and analytic) for computing the Fourier coefficients of periodic functions appearing in the asymptotic expansions of these quantities. The methods consist of the approach by Flajolet and Golin for divide-and-conquer recurrences and van der Corput's method from analytic number theory for exponential sums.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
