Browsing by Subject "Paths and cycles"

Now showing items 1-3 of 3

    • On path complexities of heapsort algorithm and the class stack 

      Mangal, Anupam (Dhirubhai Ambani Institute of Information and Communication Technology, 2007)
      A 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 ...

    • Path complexity of maximum segment sum problem 

      Mishra, Devesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...

    • Path complexity of the class binary search tree 

      Doshi, Nishant (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ...