On path complexities of heapsort algorithm and the class stack

Simple item page
dc.accession.numberT00105
dc.classification.ddc515.9 MAN
dc.contributor.advisorAmin, Ashok T.
dc.contributor.authorMangal, Anupam
dc.date.accessioned2017-06-10T14:37:07Z
dc.date.accessioned2025-06-28T10:19:09Z
dc.date.available2017-06-10T14:37:07Z
dc.date.issued2007
dc.degreeM. Tech
dc.description.abstractA measure of program complexity, called Path Complexity, based on the number of program execution paths as a function of the input size n, is proposed in [AJ05]. This measure can be used to compare the complexity of two different programs even with isomorphic control flow graphs. Using this measure, we determine the path complexity of the Heapsort algorithm. The notion of path complexity of a program is further extended to introduce the path complexity of a class. In particular, the path complexity of the Stack class is determined. We also provide an upper bound, and a lower bound based on catalan numbers, on the path complexity of the Stack class.
dc.identifier.citationMangal, Anupam (2007). On path complexities of heapsort algorithm and the class stack. Dhirubhai Ambani Institute of Information and Communication Technology, ix, 49 p. (Acc.No: T00105)
dc.identifier.urihttp://ir.daiict.ac.in/handle/123456789/142
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.student.id200511003
dc.subjectComplexity theory
dc.subjectComputational complexity
dc.subjectAlgorithms
dc.subjectPaths and cycles
dc.subjectGraph theory
dc.subjectGraph theory
dc.subjectPath analysis
dc.subjectHeapsort
dc.titleOn path complexities of heapsort algorithm and the class stack
dc.typeDissertation

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
200511003.pdf
Size:
682 KB
Format:
Adobe Portable Document Format
Download

Collections

M Tech Dissertations