Counting Sort 2


Problem Statement :


Often, when a list is sorted, the elements being sorted are just keys to other values. For example, if you are sorting files by their size, the sizes need to stay connected to their respective files. You cannot just take the size numbers and output them in order, you need to output all the required file information.

The counting sort is used if you just need to sort a list of integers. Rather than using a comparison, you create an integer array whose index range covers the entire range of values in your array to sort. Each time a value occurs in the original array, you increment the counter at that index. At the end, run through your counting array, printing the value of each non-zero valued index that number of times.

Challenge
Given an unsorted list of integers, use the counting sort method to sort the list and then print the sorted list.

Hint: You can use your previous code that counted the items to print out the actual values in order.

Function Description

Complete the countingSort function in the editor below. It should return the original array, sorted ascending, as an array of integers.

countingSort has the following parameter(s):

arr: an array of integers

Input Format

The first line contains an integer n, the length of arr. The next line contains space-separated integers  arr[i] where 0  <=  i < n .

Constraints

0  <=  n  <= 10000000
0  <=  arr[ i ]  <=  100


Output Format

Print the sorted list as a single line of space-separated integers.


Solution :



title-img 


                            Solution in C :

In   C++  :







#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


vector<int>List;
auto main()->int
{
	int size;
	cin >> size;
	//Initialize
	List.resize(100,0);
	for (int i = 0; i != size; i++)
	{
		int n;
		cin >> n;
		List[n] = List[n] + 1;
	}
	for (int r = 0; r != List.size(); r++)
	{
		for (int t = 0; t != List[r];t++)
		{
			cout << r << " ";
		}
	}
	return 0;
}










In   Java  :








import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

   	
	static void printArray(int[] ar) {
		for (int n : ar) {
			System.out.print(n + " ");
		}
		System.out.println("");
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int[] ar = new int[100];
		for (int i = 0; i < n; i++) {
			ar[in.nextInt()]++;
		}
		for(int i = 0; i <ar.length ;i++){
			while(ar[i] > 0){
				System.out.print(i + " ");
				ar[i]--;
			}
		}
		
	}
}









In   C   :







#include<stdio.h>
long a[105];
int main()
{
	long n,j;
	int v,i;
	scanf("%ld",&n);
	while(n--)
	 {
	  scanf("%d",&v);
	  a[v]++;
     }
     for(i=0;i<100;++i)
     {
     	for(j=0;j<a[i];++j)
     	printf("%d ",i);
     }
     
     return 0;
}










In  Python3  :







n = int(input())
ar = [int(x) for x in input().strip().split(' ')]

c = [0]*100
for a in ar :
    c[a] += 1
    
s = ''

for x in range(0,100) :
    for i in range(0,c[x]) :
        s += ' ' + str(x)
        
print(s[1:])








View More Similar Problems

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →

Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →

Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →

Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →