Please use this identifier to cite or link to this item:
http://localhost:80/xmlui/handle/123456789/2483Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chakraborty, Arijit | - |
| dc.contributor.author | Mitra, Avik | - |
| dc.contributor.author | Das, Dipankar | - |
| dc.date.accessioned | 2018-09-25T05:12:08Z | - |
| dc.date.available | 2018-09-25T05:12:08Z | - |
| dc.date.issued | 2015-04 | - |
| dc.identifier.issn | 2278 - 2540 | - |
| dc.identifier.uri | http://172.16.0.4:8085/heritage/handle/123456789/2484 | - |
| dc.description.abstract | In this paper, empirical analyses of mergesort algorithm has been performed to observe its run-time behaviour in personal computer. It has been observed that the behavioural pattern of its worst case matches best with series of Fourier curves, and we found that Fourier series with five harmonics matches the best. | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | Vol. 4;Issue 4 | - |
| dc.subject | Curve Fitting | en_US |
| dc.subject | Experimental Algorithmics | en_US |
| dc.subject | Fourier Fit | en_US |
| dc.subject | Merge Sort | en_US |
| dc.subject | Performance Analysis | en_US |
| dc.subject | Residual Analysis | en_US |
| dc.subject | Worst Case | en_US |
| dc.title | Empirical analysis of merge sort in personal computer by curve fitting technique | en_US |
| dc.title.alternative | (In) IJLTEMAS | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | BCA | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.