• Example Search
• Project Search

• Java
• C++
• Python
• Scala
• Blog

• Algorithms-master
  • Recursion
    • nQueen.cpp
    • .DS_Store
  • Contributors.md
  • Levenshtein
    • go.sum
    • go.mod
    • levenshtein.go
    • levenshtein_test.go
  • Mathematical Algorithms
    • power.cpp
    • LcmOfArray.py
    • Sieve of Eratosthenes
      • sieveOfEratosthenes.cpp
    • EuclideanGCD
      • euclidean_gcd.java
      • euclidean_gcd.py
      • euclidean_gcd.c
    • Kotlin
      • IsPrime.kt
    • GcdOfArray.py
    • Java
      • Permutation.class
      • Permutation.java
    • Python
      • Fibonacci.py
      • prime_number_until_n.py
  • Greedy Algorithms
    • Prims.java
    • Activityselection.cpp
    • Kruskals.java
    • Kadane's-Algorithm.cpp
    • Job Sequencing.cpp
    • Fractional-Knapsack.cpp
  • String Matching
    • NaiveStringSearch.cpp
    • matching.py
    • KMP.cpp
    • Rabin-Karp.cpp
  • Dynamic Programming
    • gcd.cpp
    • coin_change.py
    • n-queen.cpp
    • longestcommonsubsequence.cpp
    • cutting-a-rod.php
    • Knapsack.cpp
    • Golombsequence.cpp
  • Cryptography Algorithms
    • Cpp
      • CeaserCipher.cpp
    • Python
      • OneTimePad.py
  • LICENSE
  • Backtracking
    • HamiltonianCycles.java
    • SumOfSubsets.cpp
    • mColor.java
  • CONTRIBUTING.md
  • .DS_Store
  • Sorting Algorithms
    • C-CPP
      • merge_sort.cpp
      • bubble_sort.cpp
      • merge_sort.c
      • insertion_sort.c
      • QuickSort.c
      • selection_sort.c
      • heap_sort.cpp
      • ShellSort.cpp
      • shell_sort.c
      • counting_sort.cpp
      • bucketsort.cpp
      • quick_sort.cpp
      • bubble_sort.c
      • radix_sort.cpp
      • BinaryInsertion.cpp
      • selection_sort.cpp
      • heap_sort.c
      • insertion_sort.cpp
      • bogosort.cpp
    • php
      • mergesort.php
      • Quick_Sort.php
      • selectionsort.php
      • insertionsort.php
    • GO
      • bubble_sort.go
    • Java
      • InsertionSort.java
      • BubbleSort.java
      • MergeSort.java
      • SelectionSort.java
      • HeapSort.java
      • QuickSort.java
    • CSharp
      • QuickSort.cs
      • BubbleSort.cs
    • Python
      • radix_sort.py
      • insertion.py
      • bubble_sort.py
      • merge_sort.py
      • ShellSort.py
      • bogo_sort.py
      • topological_sort_in_python.py
      • shell_sort.py
      • counting_sort.py
      • wiggle_sort.py
      • quick_sort.py
      • bucket_sort.py
    • Swift
      • bubbleSort.swift
  • Search Algorithms
    • Ruby
      • LinearSearch.rb
    • C-CPP
      • LinearSearchSentinelValue.c
      • LinearSearchSentinelValue.cpp
      • Binary_search.c
      • binarysearchusingrecursion.cpp
      • Interpolation_Search.cpp
      • a.out
      • exponentialsearch.c
      • Linear Search.cpp
      • jump_search.c
      • LinearSearch.c
      • BinarySearch.cpp
      • jumpSearch.cpp
    • Kotlin
      • InterpolationSearch.kt
      • LinearSearch.kt
      • BinarySearch.kt
    • Golang
      • go.mod
      • linear
        • LinearSearch.go
      • main.go
    • Java
      • LinearSearch.java
      • InterpolationSearch.java
      • JumpSearch.java
      • BinarySearch.java
    • Dlang
      • linear.d
      • binary.d
    • CSharp
      • linearSearch.cs
    • Python
      • jump_search.py
      • binary_search.py
      • ExponentialSearch.py
      • breath-first-search.py
      • InterpolationSearch.py
      • FibonacciSearch.py
      • linear_search.py
      • RecursiveSearch.py
  • Graph
    • dfs_and_bfs.cpp
    • SPATH.C
  • String Manipulation
    • cifracesar.c
    • php
      • palindrome.php
    • split.cpp
    • pallindrome.cpp
    • Python
      • check_if_is_palindrome.py
      • occurence.py
    • led_string.c
  • README.md
  • Wilson's Theorem
    • Wilson'sTheorem.py
    • README.md
  • Graph Algorithms
    • Cycle in undirected Graph.cpp
    • fleury.cpp
    • Bellman–Ford Algorithm.cpp
    • Dial's algorithm.cpp
    • Boruvka_MST.c
    • Dijikstras.java
  • Huffman_Coding
    • Huffman_Coding.cpp
  • Binary Tree
    • BinaryTreeTraversal.cpp
    • bst.java
    • Binary Tree Traversal.c

#include<iostream>
using namespace std;

void Count_Sort(int a[],int n,int k){
    int freq[k+1]={0};

    for(int i=0;i<n;i++){
        ++freq[a[i]];
    }

    int j=0;

    for(int i=0;i<=k;i++){
        int temp=freq[i];

        while(temp--){
            a[j++]=i;
        }
    }
}

int main(){
    int n;
    cout<<"Enter Size of Array you want to sort: ";
    cin>>n;
    int a[n],maxi=-1;
    cout<<"Enter space separated +ev integers here: ";
    for(int i=0;i<n;i++){
        cin>>a[i];
        if(maxi<a[i]){
            maxi=a[i];
        }
    }
    cout<<"Befor Sorting: ";
    for(int i=0;i<n;i++){
        cout<<a[i]<<' ';
    }
    cout<<'\n';

    Count_Sort(a,n,maxi);

    for(int i=0;i<n;i++){
        cout<<a[i]<<' ';
    }
    cout<<'\n';
return 0;
}