https://github.com/sanjaraiy/dsa_series

Explore the efficiency of countSort in this DSA playground! 📊✨ Master sorting algorithms with hands-on practice.
https://github.com/sanjaraiy/dsa_series

alogrithms countsort cpp data-structure-and-algorithm data-structures vscode

Last synced: 5 days ago
JSON representation

Explore the efficiency of countSort in this DSA playground! 📊✨ Master sorting algorithms with hands-on practice.

• Host: GitHub
• URL: https://github.com/sanjaraiy/dsa_series
• Owner: sanjaraiy
• Created: 2023-11-23T12:37:37.000Z (12 months ago)
• Default Branch: main
• Last Pushed: 2024-06-23T00:41:25.000Z (5 months ago)
• Last Synced: 2024-06-23T04:45:04.749Z (5 months ago)
• Topics: alogrithms, countsort, cpp, data-structure-and-algorithm, data-structures, vscode
• Language: C++
• Homepage:
• Size: 3.91 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# CountSort Algorithm Implementation

This repository contains a C++ implementation of the CountSort algorithm. CountSort is a non-comparison based sorting algorithm suitable for sorting integers within a specified range.

## Overview

CountSort operates by counting occurrences of each unique element in the input array, computing the cumulative count, and placing elements in their correct positions in the output array. It works efficiently for a limited range of integers, making it suitable for scenarios where the range of input elements is known beforehand.

## Features

- **Efficient Sorting:** CountSort achieves linear time complexity O(n + k), where n is the number of elements and k is the range of input.

- **Stable Sorting:** Maintains the relative order of records with equal keys.

- **Simple Implementation:** Easy to understand and implement in scenarios where the range of elements is not very large.

## Usage

To use CountSort for sorting an array of integers:

1. Clone the repository or download the `countSort.cpp` file.

2. Compile the code using a C++ compiler.

3. Execute the compiled program, providing input integers to be sorted.

## Example

Consider an input array: [4, 2, 2, 8, 3, 3, 1]

After sorting using CountSort: [1, 2, 2, 3, 3, 4, 8]

## How to Run

Ensure you have a C++ compiler installed. Compile the code using the following command:

```bash

g++ countSort.cpp -o countSort

```

Run the executable:

```bash

./countSort

```

## code.cpp 

```cpp

#include

#include

using namespace std;

void CountSort(vector &v){

    int n=v.size();

    //find the max element

    int max_ele=INT_MIN;

    for(int i=0;ifreq(max_ele+1,0);

    for(int i=0;ians(n);

    //calculate sorted array

    for(int i=n-1;i>=0;i--){

        ans[--freq[v[i]]]=v[i];

    }

    //copy back the ans to origional array

    for(int i=0;i>n;

    vectorv(n);

    for(int i=0;i>v[i];

    }

    CountSort(v);

    cout<<"sorted Array:"<