A Statistical Analysis of Bubble Sort in terms of Serial and Parallel Computation

Persistent Link:
http://hdl.handle.net/10150/214089
Title:
A Statistical Analysis of Bubble Sort in terms of Serial and Parallel Computation
Author:
Panigrahi, Sunil Kumar; Chakraborty, Soubhik; Mishra, Jibitesh
Affiliation:
Dept of Computer Science and Engineering, APEX Institute of Technology & Management, Pahal, Bhubaneswar-752101, Orissa, India
Publisher:
IJCSN Journal
Journal:
IJCSN
Issue Date:
15-Feb-2012
URI:
http://hdl.handle.net/10150/214089
Additional Links:
http://ijcsn.org/publications.html
Abstract:
In 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
Type:
Article; Technical Report
Language:
en
Keywords:
Weight; Statistical bound; Complexity; Pivotal reason; Worst case
Series/Report no.:
IJCSN-2012-1-1-1
ISSN:
2277–5420
Sponsors:
IJCSN Journal

Full metadata record

DC FieldValue Language
dc.contributor.authorPanigrahi, Sunil Kumaren_US
dc.contributor.authorChakraborty, Soubhiken_US
dc.contributor.authorMishra, Jibiteshen_US
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 bounden_US
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
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.