Please use this identifier to cite or link to this item:
http://localhost:80/xmlui/handle/123456789/2499| Title: | Sample based curve fitting computation on the performance of quicksort in personal computer |
| Other Titles: | (In) International Journal of Scientific & Engineering Research |
| Authors: | Das, Dipankar Chakraborty, Arijit Mitra, Avik |
| Keywords: | Curve Fitting Experimental Algorithmics Fourier Fit Graphical Residual Analysis Performance Analysis Quicksort Worst Case |
| Issue Date: | Feb-2014 |
| Series/Report no.: | Vol. 5;Issue 2 |
| Abstract: | In this paper we have used curve fitting technique for analyzing the classical Quicksort algorithm and its erformance in worst case on personal computer. The proposed generic model can be viewed as: Time ~ f (Number of Elements). We fit the data points (Time vs Number of elements) in twenty one different models from various types of fit such as Polynomial, Exponential, Power, Gaussian and Fourier. This analysis leads us to identify the best model amongst these models. We found that a model of Fourier series is the best fit. |
| URI: | http://172.16.0.4:8085/heritage/handle/123456789/2499 |
| ISSN: | 2229-5518 |
| Appears in Collections: | BCA |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.