Please use this identifier to cite or link to this item: http://localhost:80/xmlui/handle/123456789/1730
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChakraborty, Arijit-
dc.contributor.authorMitra, Avik-
dc.contributor.authorDas, Dipankar-
dc.date.accessioned2018-03-13T09:44:20Z-
dc.date.available2018-03-13T09:44:20Z-
dc.date.issued2015-04-
dc.identifier.issn2278 - 2540-
dc.identifier.urihttp://hdl.handle.net/123456789/1730-
dc.description.abstractIn 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.isoenen_US
dc.publisherResearch Gateen_US
dc.relation.ispartofseriesVolume 4;Issue :4-
dc.subjectCurve fittingen_US
dc.subjectexperimental algorithmicsen_US
dc.subjectFourier fiten_US
dc.subjectmerge sorten_US
dc.subjectperformance analysisen_US
dc.subjectresidual analysisen_US
dc.subjectworst caseen_US
dc.titleEmpirical Analysis of Merge sort in Personal Computer by Curve Fitting Techniqueen_US
dc.title.alternative(In) International Journal of Latest Technology in Engineering, Management & Applied Scienceen_US
dc.typeArticleen_US
Appears in Collections:BCA

Files in This Item:
File Description SizeFormat 
EmpiricalAnalysisofMergesort.pdf812.86 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.