/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 vote138 views1 answer
Declaration in c
C
0 vote128 views1 answer
Solutionadda
C
1 vote136 views1 answer
ERROR: cannot verify nvidia.box.com's certificate, issued by 'CN=GeoTrust RSA CA 2018,OU=www.
C
0 vote143 views1 answer
C interview questions for experienced
C
0 vote137 views1 answer
Attiny pinout
C
0 vote140 views1 answer
UTC offset upper limit
C
0 vote169 views1 answer
'keras.backend' is not a package
C
0 vote189 views1 answer
C program to calculate the sum of odd and even numbers
C
0 vote161 views1 answer
How many archaeologists are there
C
3 votes140 views1 answer
Fast inverse square root explained
C