Show simple item record

dc.contributor.authorPanigrahi, Sunil Kumar
dc.contributor.authorChakraborty, Soubhik
dc.contributor.authorMishra, Jibitesh
dc.date.accessioned2012-03-02T16:16:25Z
dc.date.available2012-03-02T16:16:25Z
dc.date.issued2012-02-15
dc.identifier.issn2277–5420
dc.identifier.urihttp://hdl.handle.net/10150/214089
dc.description.abstractIn some recent papers, the weight based statistical bounds have arguably explained time complexity better than the count based mathematical bounds. This is definitely true for average case where for an arbitrary code it is difficult to identify the pivotal operation or pivotal region in the code for taking the expectation and/or when the probability distribution, over which expectation is taken, becomes unrealistic over the problem domain. In worst case, it can certify whether a mathematical bound is conservative or not. Here we revisit the results on Bubble sort in sequential mode and make an independent study of the same algorithm in parallel mode using statistical bound
dc.description.sponsorshipIJCSN Journalen_US
dc.language.isoenen_US
dc.publisherIJCSN Journalen_US
dc.relation.ispartofseriesIJCSN-2012-1-1-1en_US
dc.relation.urlhttp://ijcsn.org/publications.htmlen_US
dc.subjectWeighten_US
dc.subjectStatistical bounden_US
dc.subjectComplexityen_US
dc.subjectPivotal reasonen_US
dc.subjectWorst caseen_US
dc.titleA Statistical Analysis of Bubble Sort in terms of Serial and Parallel Computationen_US
dc.typeArticleen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentDept of Computer Science and Engineering, APEX Institute of Technology & Management, Pahal, Bhubaneswar-752101, Orissa, Indiaen_US
dc.identifier.journalIJCSNen_US
refterms.dateFOA2018-06-18T02:17:05Z
html.description.abstractIn some recent papers, the weight based statistical bounds have arguably explained time complexity better than the count based mathematical bounds. This is definitely true for average case where for an arbitrary code it is difficult to identify the pivotal operation or pivotal region in the code for taking the expectation and/or when the probability distribution, over which expectation is taken, becomes unrealistic over the problem domain. In worst case, it can certify whether a mathematical bound is conservative or not. Here we revisit the results on Bubble sort in sequential mode and make an independent study of the same algorithm in parallel mode using statistical bound


Files in this item

Thumbnail
Name:
IJCSN-2012-1-1-1.pdf
Size:
221.1Kb
Format:
PDF
Description:
A Statistical Analysis of Bubble ...

This item appears in the following Collection(s)

Show simple item record