How to sort a range of int array using qsort in C

1 Answer

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

#define LEN 7

void sortRange(int arr[], int start, int len);
void print_array(int arr[], int len);
int compare(const void *a, const void *b);

int main(void)
{
    int arr[LEN] = {8, 3, 5, 2, 0, 1, 7};
   
    sortRange(arr, 2, 4);
    print_array(arr, LEN);
   
    return 0;
}

void sortRange(int arr[], int start, int len)
{
    qsort(arr + start, len, sizeof(int), compare);
}

int compare(const void *a, const void *b)
{
   return ( *(int*)a - *(int*)b );
}
 
void print_array(int arr[], int len)
{
    int i;
      
    for (i = 0; i < len; i++) printf("%4d", arr[i]);
}

/*
run:
   
  8   3   0   1   2   5   7

*/


answered Mar 7, 2015 by avibootz

Related questions

1 answer 260 views
1 answer 175 views
1 answer 109 views
109 views asked Nov 11, 2021 by avibootz
1 answer 188 views
188 views asked Dec 4, 2019 by avibootz
1 answer 72 views
72 views asked Jan 19, 2024 by avibootz
...