Scribd Logo
Upload

Welcome to Scribd!

  • Big O Notation Chart

    Uploaded by

    Eesha Kanwar
    33 views2 pages
    This document lists common methods used with linked lists and linked sorted lists along with their Big-O time complexity. For regular linked lists, common operations like insertion, removal, searching, and counting have linear O(n) time complexity, while checking the length or peeking at an element have constant O(1) time. More complex operations like cleaning or merging lists have quadratic O(n^2) time complexity. For linked sorted lists, the same operations are generally linear except finding the minimum or maximum element, which have constant O(1) time.

    Original Description:

    Big O

    Original Title

    Big_O_Notation_Chart.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document lists common methods used with linked lists and linked sorted lists along with their Big-O time complexity. For regular linked lists, common operations like insertion, removal, searching, and counting have linear O(n) time complexity, while checking the length or peeking at an element have constant O(1) time. More complex operations like cleaning or merging lists have quadratic O(n^2) time complexity. For linked sorted lists, the same operations are generally linear except finding the minimum or maximum element, which have constant O(1) time.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    33 views2 pages

    Big O Notation Chart

    Uploaded by

    Eesha Kanwar
    This document lists common methods used with linked lists and linked sorted lists along with their Big-O time complexity. For regular linked lists, common operations like insertion, removal, searching, and counting have linear O(n) time complexity, while checking the length or peeking at an element have constant O(1) time. More complex operations like cleaning or merging lists have quadratic O(n^2) time complexity. For linked sorted lists, the same operations are generally linear except finding the minimum or maximum element, which have constant O(1) time.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Data Structure Method Big-O Notation

    Linked List Index O(n)

    Insert O(n)

    Min O(n)

    Identical O(n)

    Max O(n)

    Clean O(n2)

    _linear_search O(n)

    Remove_many O(n)

    _len_ O(1)

    Union O(n2)

    Count O(n)

    _contains_ O(n)

    Intersection O(n2)

    Remove O(n)

    Combine O(n)

    Peek O(1)

    Find O(n)

    Split O(n)

    Is_empty O(1)

    Insert_front O(1)

    Linked Sorted List Split O(n)

    Count O(n)
    Remove O(n)

    Find O(n)

    Index O(n)

    Identical O(n)

    Min O(1)

    _linear_search O(n)

    Combine O(n)

    Peek O(1)

    Insert O(n)

    Union O(n)

    Intersection O(n)

    Max O(n)

    Clean O(n)

    _contains_ O(n)

    is_empty O(1)

    _len_ O(1)

    You might also like