CareerCup

Counting sort

public static void countingSort(int [] m)
	{
		int [] counts=new int[10];
		for(int i=0;i<counts.length;i++)
			counts[i]=0;
		for(int i=0;i<m.length;i++)
		{
			counts[m[i]]++;
		}
		int counter=0;
		for(int i=0;i<counts.length;i++)
		{
			for(int j=0;j<counts[i];j++)
			{
				m[counter]=i;
				counter++;
			}
		}
	}

use bucket sort.

Create BST and then inorder traversal

method 1: use an array of arr[10] for ten 1digit numbers.
increment count of digit in array.
print the digit no of times specified in the array

unsorted list 6 1 4 1

arr 0 1 2 3 4 5 6 7 8 9
val 0 2 1 0 1 0 1 0 0 0

sorted list: 1 1 4 6

method 2:
use radix sort if array can fit in memory

Shouldn't second last for loop be -

for(int i=0;i<10;i++)