{"id":25188,"date":"2017-10-15T14:49:54","date_gmt":"2017-10-15T09:19:54","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25188"},"modified":"2017-10-15T14:49:54","modified_gmt":"2017-10-15T09:19:54","slug":"counting-sort","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/counting-sort\/","title":{"rendered":"Counting Sort"},"content":{"rendered":"

Counting Sort is a sorting technique based on keys between a specific range.<\/span> It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence.<\/p>\n

Let us understand it with the help of an example.<\/p>\n

For simplicity, consider the data in the range 0 to 9. \r\nInput data: 1, 4, 1, 2, 7, 5, 2\r\n  1) Take a count array to store the count of each unique object.\r\n  Index:     0  1  2  3  4  5  6  7  8  9\r\n  Count:     0  2  2  0   1  1  0  1  0  0\r\n\r\n  2) Modify the count array such that each element at each index \r\n  stores the sum of previous counts. \r\n  Index:     0  1  2  3  4  5  6  7  8  9\r\n  Count:     0  2  4  4  5  6  6  7  7  7\r\n\r\nThe modified count array indicates the position of each object in \r\nthe output sequence.\r\n \r\n  3) Output each object from the input sequence followed by \r\n  decreasing its count by 1.\r\n  Process the input data: 1, 4, 1, 2, 7, 5, 2. Position of 1 is 2.\r\n  Put data 1 at index 2 in output. Decrease count by 1 to place \r\n  next data 1 at an index 1 smaller than this index.\r\n<\/pre>\n[ad type=”banner”]\n
Following is C implementation of counting sort.<\/p>\n
 
 c<\/span> <\/div> 
\/\/ C Program for counting sort#include <stdio.h>#include <string.h>#define RANGE 255 \/\/ The main function that sort the given string arr[] in\/\/ alphabatical ordervoid countSort(char arr[]){    \/\/ The output character array that will have sorted arr    char output[strlen(arr)];     \/\/ Create a count array to store count of inidividul    \/\/ characters and initialize count array as 0    int count[RANGE + 1], i;    memset(count, 0, sizeof(count));     \/\/ Store count of each character    for(i = 0; arr[i]; ++i)        ++count[arr[i]];     \/\/ Change count[i] so that count[i] now contains actual    \/\/ position of this character in output array    for (i = 1; i <= RANGE; ++i)        count[i] += count[i-1];     \/\/ Build the output character array    for (i = 0; arr[i]; ++i)    {        output[count[arr[i]]-1] = arr[i];        --count[arr[i]];    }     \/\/ Copy the output array to arr, so that arr now    \/\/ contains sorted characters    for (i = 0; arr[i]; ++i)        arr[i] = output[i];} \/\/ Driver program to test above functionint main(){    char arr[] = "geeksforgeeks";\/\/"applepp";     countSort(arr);     printf("Sorted character array is %s\\n", arr);    return 0;}<\/code><\/pre> <\/div>\n
JAVA<\/strong><\/p>\n
 
 java<\/span> <\/div> 
\/\/ Java implementation of Counting Sortclass CountingSort{    void sort(char arr[])    {        int n = arr.length;         \/\/ The output character array that will have sorted arr        char output[] = new char[n];         \/\/ Create a count array to store count of inidividul        \/\/ characters and initialize count array as 0        int count[] = new int[256];        for (int i=0; i<256; ++i)            count[i] = 0;         \/\/ store count of each character        for (int i=0; i<n; ++i)            ++count[arr[i]];         \/\/ Change count[i] so that count[i] now contains actual        \/\/ position of this character in output array        for (int i=1; i<=255; ++i)            count[i] += count[i-1];         \/\/ Build the output character array        for (int i = 0; i<n; ++i)        {            output[count[arr[i]]-1] = arr[i];            --count[arr[i]];        }         \/\/ Copy the output array to arr, so that arr now        \/\/ contains sorted characters        for (int i = 0; i<n; ++i)            arr[i] = output[i];    }     \/\/ Driver method    public static void main(String args[])    {        CountingSort ob = new CountingSort();        char arr[] = {'g', 'e', 'e', 'k', 's', 'f', 'o',                      'r', 'g', 'e', 'e', 'k', 's'                     };         ob.sort(arr);         System.out.print("Sorted character array is ");        for (int i=0; i<arr.length; ++i)            System.out.print(arr[i]);    }}<\/code><\/pre> <\/div>\n
PYTHON<\/strong><\/p>\n
 
 python<\/span> <\/div> 
# Python program for counting sort # The main function that sort the given string arr[] in # alphabetical orderdef countSort(arr):     # The output character array that will have sorted arr    output = [0 for i in range(256)]     # Create a count array to store count of inidividul    # characters and initialize count array as 0    count = [0 for i in range(256)]     # For storing the resulting answer since the     # string is immutable    ans = ["" for _ in arr]     # Store count of each character    for i in arr:        count[ord(i)] += 1     # Change count[i] so that count[i] now contains actual    # position of this character in output array    for i in range(256):        count[i] += count[i-1]     # Build the output character array    for i in range(len(arr)):        output[count[ord(arr[i])]-1] = arr[i]        count[ord(arr[i])] -= 1     # Copy the output array to arr, so that arr now    # contains sorted characters    for i in range(len(arr)):        ans[i] = output[i]    return ans  # Driver program to test above functionarr = "geeksforgeeks"ans = countSort(arr)print "Sorted character array is %s"  %("".join(ans)) <\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Sorted character array is eeeefggkkorss<\/pre>\n
Time Complexity:<\/strong> O(n+k) where n is the number of elements in input array and k is the range of input.
\nAuxiliary Space:<\/strong> O(n+k)<\/p>\n
Points to be noted:<\/strong>
\n1.<\/strong> Counting sort is efficient if the range of input data is not significantly greater than the number of objects to be sorted. Consider the situation where the input sequence is between range 1 to 10K and the data is 10, 5, 10K, 5K.
\n2.<\/strong> It is not a comparison based sorting. It running time complexity is O(n) with space proportional to the range of data.
\n3.<\/strong> It is often used as a sub-routine to another sorting algorithm like radix sort.
\n4.<\/strong> Counting sort uses a partial hashing to count the occurrence of the data object in O(1).
\n5.<\/strong> Counting sort can be extended to work for negative inputs also.<\/p>\n
Exercise:<\/strong>
\n1.<\/strong> Modify above code to sort the input data in the range from M to N.
\n2.<\/strong> Modify above code to sort negative input data.
\n3.<\/strong> Is counting sort stable and online?
\n4. <\/strong>Thoughts on parallelizing the counting sort algorithm.<\/p>\n[ad type=”banner”]\n
 <\/p>\n","protected":false},"excerpt":{"rendered":"
Counting sort – Searching and Sorting – Counting Sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing).<\/p>\n","protected":false},"author":1,"featured_media":25191,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,71670],"tags":[71894,71852,71847,71840,71893,70263,70268,70461,71121,71879,71122,71884,71874,71877,70780,71833,71869,71891,70497,71868,71885,71875,70271,70928,70017,71225,71881,70262,71262,71872,71889,71289,71892,71886,71878,71267,70046,71145,70977,71266,71870,71844,71857,71858,71846,71843,71880,71120,70016,71883,71697,71873,71890,71674,71308,71125,71695,71871,70020,71882,70652,70019,71887,71876,71888],"class_list":["post-25188","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-algorithm","category-searching-and-sorting","tag-71894","tag-algorithm-for-radix-sort","tag-algorithm-for-radix-sort-in-data-structure","tag-algorithm-of-radix-sort","tag-algorithm-sort","tag-binary-search-tree","tag-binary-tree","tag-bubble-sort","tag-bubble-sort-algorithm","tag-bubble-sort-concept","tag-bubble-sort-java","tag-bubble-sort-online","tag-bubble-sort-technique","tag-bubble-sort-theory","tag-bubblesort","tag-comb-sort","tag-count-python","tag-counting-algorithm","tag-counting-sort","tag-counting-sort-algorithm","tag-decision-tree-sorting","tag-example-of-counting-sort","tag-heap-sort","tag-heap-sort-algorithm","tag-insertion-sort-algorithm","tag-insertion-sort-program","tag-math-sort","tag-merge-sort","tag-merge-sort-algorithm","tag-merge-sort-algorithm-c-code","tag-merge-sort-algorithm-explanation","tag-merge-sort-algorithm-in-c","tag-merge-sort-algorithm-java","tag-pseudocode-for-sorting-algorithms","tag-python-sorting-algorithms","tag-quick-sort-algorithm","tag-quicksort","tag-quicksort-c","tag-quicksort-java","tag-radix-sort-algorithm","tag-radix-sort-algorithm-in-data-structure","tag-radix-sort-algorithm-in-java","tag-radix-sort-algorithm-pseudocode","tag-radix-sort-analysis","tag-radix-sort-applications","tag-radix-sort-code-java","tag-radix-sort-in-c","tag-selection-sort","tag-selection-sort-algorithm","tag-selection-sort-simulation","tag-shell-sort","tag-short-bubble-sort","tag-simple-merge-sort-algorithm","tag-sort","tag-sort-array","tag-sort-code","tag-sorted","tag-sorted-python","tag-sorting-algorithms","tag-sorting-algorithms-explained-with-examples","tag-sorting-algorithms-in-c","tag-sorting-algorithms-in-java","tag-sorting-by-counting","tag-sorting-code-in-c","tag-what-is-merge-sort-algorithm"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25188","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25188"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25188\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/25191"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25188"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25188"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}