package algorithm; public class MyCountingSort { public void countSort(int[] a, int n, int l, int h) { int[] count = new int[h]; for(int i=0;i=0;i--) { temp[count[a[i]] - 1] = a[i]; count[a[i]]--; } for(int i=0;i