Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Time Complexity Sorintg

    Uploaded by

    Abinash Satpathy
    This document discusses the time complexity of common sorting algorithms. Insertion sort has best-case complexity of O(n) when elements are already sorted, and worst-case of O(n^2) when elements are reverse sorted. Mergesort has complexity of O(nlogn). Quicksort has best-case of O(nlogn) when partitioning splits arrays evenly, but worst-case of O(n^2) when it splits arrays with very uneven element counts.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Time Complexity Sorintg

    Uploaded by

    Abinash Satpathy
    7 views4 pages
    This document discusses the time complexity of common sorting algorithms. Insertion sort has best-case complexity of O(n) when elements are already sorted, and worst-case of O(n^2) when elements are reverse sorted. Mergesort has complexity of O(nlogn). Quicksort has best-case of O(nlogn) when partitioning splits arrays evenly, but worst-case of O(n^2) when it splits arrays with very uneven element counts.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses the time complexity of common sorting algorithms. Insertion sort has best-case complexity of O(n) when elements are already sorted, and worst-case of O(n^2) when elements are reverse sorted. Mergesort has complexity of O(nlogn). Quicksort has best-case of O(nlogn) when partitioning splits arrays evenly, but worst-case of O(n^2) when it splits arrays with very uneven element counts.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    7 views4 pages

    Time Complexity Sorintg

    Uploaded by

    Abinash Satpathy
    This document discusses the time complexity of common sorting algorithms. Insertion sort has best-case complexity of O(n) when elements are already sorted, and worst-case of O(n^2) when elements are reverse sorted. Mergesort has complexity of O(nlogn). Quicksort has best-case of O(nlogn) when partitioning splits arrays evenly, but worst-case of O(n^2) when it splits arrays with very uneven element counts.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 4

    Time Complexity of Sorting

    Algorithms
    Insertion Sort
    Best Case : When the elements are already
    sorted O(n)

    Worst case: When the elements are sorted in


    the reverse order O(n2)
    Merger Sort

    Time complexity is O(nlogn)


    Quick Sort

    Worst case when every time the array splits


    subarrays of 0 and N-1 elemetns. O(n2)

    Best case when partioning happes at n/2


    every time. O(nlogn).

    You might also like