Scribd Logo
Upload

Welcome to Scribd!

  • 35 views

    Time & Space Complexity - Counting Sort

    Uploaded by

    RishiGupta
    Counting Sort is an algorithm that sorts elements in an array by counting the number of occurrences of each unique element and using that count to place the elements in output. It has a time complexity of O(n+k) where n is the length of the input array and k is the number of unique symbols. It uses O(n+k) space to store the counts and output array.

    Copyright:

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

    You might also like

    Time & Space Complexity - Counting Sort

    Uploaded by

    RishiGupta
    35 views1 page
    Counting Sort is an algorithm that sorts elements in an array by counting the number of occurrences of each unique element and using that count to place the elements in output. It has a time complexity of O(n+k) where n is the length of the input array and k is the number of unique symbols. It uses O(n+k) space to store the counts and output array.

    Original Description:

    Complexity of Counting Sort time and space

    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
    Counting Sort is an algorithm that sorts elements in an array by counting the number of occurrences of each unique element and using that count to place the elements in output. It has a time complexity of O(n+k) where n is the length of the input array and k is the number of unique symbols. It uses O(n+k) space to store the counts and output array.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    35 views1 page

    Time & Space Complexity - Counting Sort

    Uploaded by

    RishiGupta
    Counting Sort is an algorithm that sorts elements in an array by counting the number of occurrences of each unique element and using that count to place the elements in output. It has a time complexity of O(n+k) where n is the length of the input array and k is the number of unique symbols. It uses O(n+k) space to store the counts and output array.

    Copyright:

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

    Algorithm

    Counting Sort, known also as Histogram Sort


    n = length of input Array
    k = number of unique symbols that appear in the input
    Array

    Initialization takes k time


    down vote

    Counting takes n time


    Enumeration takes Sum { Count(i) } = n time
    Complexity
    Time = k + n + n = 2n+k
    Time ~ O(2n+k) = O(n+k)
    Space = n + k ~ O(n+k)

    You might also like