Skip to main content
Taylor & Francis Group Logo
    Advanced Search

    Click here to search products using title name,author name and keywords.

    • Login
    • Hi, User  
      • Your Account
      • Logout
      Advanced Search

      Click here to search products using title name,author name and keywords.

      Breadcrumbs Section. Click here to navigate to respective pages.

      Chapter

      B Complexity Analysis
      loading

      Chapter

      B Complexity Analysis

      DOI link for B Complexity Analysis

      B Complexity Analysis book

      B Complexity Analysis

      DOI link for B Complexity Analysis

      B Complexity Analysis book

      BySally. A Goldman, Kenneth. J Goldman
      BookA Practical Guide to Data Structures and Algorithms using Java

      Click here to navigate to parent product.

      Edition 1st Edition
      First Published 2007
      Imprint Chapman and Hall/CRC
      Pages 12
      eBook ISBN 9780429147104
      Share
      Share

      ABSTRACT

      A primary goal of this handbook is to guide a reader with a specific problem to the most appropriate data structure(s) and the most appropriate algorithm(s) for a particular application. Generally, the most important criteria in this selection process is the efficiency, in time and space, of the solution. Therefore, a natural question arises: How does one measure the efficiency of an algorithm or data structure method? As a simple example, we consider the problem of sorting a collection of n comparable elements. The algorithm’s execution time depends on many things, including:

      • The hardware on which the algorithm will be executed. • The compiler used create the executable. • The size of the input (i.e., n = 1000 versus n = 1, 000, 000). • The form of the input itself. For example, if insertion sort is given an input that is nearly

      sorted, it runs very quickly, yet it runs much more slowly on an input in reverse sorted order.

      T&F logoTaylor & Francis Group logo
      • Policies
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
        • Privacy Policy
        • Terms & Conditions
        • Cookie Policy
      • Journals
        • Taylor & Francis Online
        • CogentOA
        • Taylor & Francis Online
        • CogentOA
      • Corporate
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
        • Taylor & Francis Group
      • Help & Contact
        • Students/Researchers
        • Librarians/Institutions
        • Students/Researchers
        • Librarians/Institutions
      • Connect with us

      Connect with us

      Registered in England & Wales No. 3099067
      5 Howick Place | London | SW1P 1WG © 2022 Informa UK Limited