fork download
copy 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. void countingSort(int *array, int size);
  5. void printArray(int *array, int size);
  6. int findMax(int *array, int size);
  7.  
  8. int main(void) {
  9. 	int set[] = {41, 2, 17, 37, 22, 104, 86, 92, 11, 58, 34};
  10. 	int size = sizeof(set)/sizeof(set[0]);
  11.  
  12. 	printf("Array before sorting: \n");
  13. 	printArray(set, size);
  14.  
  15. 	countingSort(set, size);
  16.  
  17. 	printf("\nArray after sorting: \n");
  18. 	printArray(set, size);
  19.  
  20. 	return 0;
  21. }
  22.  
  23. void printArray(int *array, int size){
  24. 	for(int i = 0; i < size; i++){
  25. 		printf("%d ", array[i]);
  26. 	}
  27. 	printf("\n");
  28. }
  29.  
  30. void countingSort(int *array, int size){
  31. 	int range = findMax(array, size) + 1;
  32. 	int count[range];
  33. 	int output[size];
  34. 	int i;
  35. 	for(i = 0; i < range; i++){
  36. 		count[i] = 0;
  37. 	}
  38.  
  39. 	for(i = 0; i < size; i++){
  40. 		++count[array[i]];
  41. 	}
  42.  
  43. 	for(i = 1; i < range; i++){
  44. 		count[i] += count[i - 1];
  45. 	}
  46.  
  47. 	for(i = size - 1; i >= 0; i--){
  48. 		output[count[array[i]] - 1] = array[i];
  49. 		--count[array[i]];
  50. 	}
  51.  
  52. 	for(i = 0; i < size; i++){
  53. 		array[i] = output[i];
  54. 	}
  55. }
  56.  
  57. int findMax(int *array, int size){
  58. 	int max = 0;
  59. 	for(int i = 0; i < size; i++){
  60. 		if(array[i] > max)
  61. 			max = array[i];
  62. 	}
  63. 	return max;
  64. }
  65.  
Success #stdin #stdout 0s 2168KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Array before sorting: 
41 2 17 37 22 104 86 92 11 58 34 

Array after sorting: 
2 11 17 22 34 37 41 58 86 92 104
https://ideone.com/8KufYj
language:
C (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!