/C/Counting sort using malloc and size-t type c

Counting sort using malloc and size-t type c

#include <stdio.h>
#include <stdlib.h>

void counting_sort_mm(int *array, int n, int min, int max)
{
  int i, j, z;

  int range = max - min + 1;
  int *count = malloc(range * sizeof(*array));

  for(i = 0; i < range; i++) count[i] = 0;
  for(i = 0; i < n; i++) count[ array[i] - min ]++;

  for(i = min, z = 0; i <= max; i++) 
  {
    for(j = 0; j < count[i - min]; j++) 
    {
      array[z++] = i;
    }
  } 

  free(count);
}

void counting_sort(int *array, int n)
{
  int i, min, max;

  min = max = array[0];
  for(i=1; i < n; i++) 
  {
    if ( array[i] < min ) 
    {
      min = array[i];
    } else if ( array[i] > max ) 
    {
      max = array[i];
    }
  }
}

Source: stackoverflow.com

Similar codes

0 vote118 views1 answer
Gdebi install with yes option
C
0 vote124 views1 answer
Sdl_rect
C
0 vote108 views1 answer
Counting Sort C
C
1 vote58 views1 answer
What is "," in programming syntax
C
0 vote118 views6 answers
C++ to c converter online
C
0 vote146 views1 answer
Fungetc
C
0 vote118 views2 answers
How to get visibility of element android
C
0 vote113 views1 answer
Sieve of eratosthenes c
C
1 vote189 views1 answer
C colour
C
2 votes102 views2 answers
Linux directory commands
C