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

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →

Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →

Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →

Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →

Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →