Thread: Could use some help with qsort

I'm having trouble setting this up correctly, could someone point out my errors ?

Code:

#include <stdio.h>
double arrayOne[] = {2.3, 5.9, 2.7, 1.9, 3.6, 8.10},
         arrayTwo[] = {6.1, 0.2, 3.5, 2.8},
         arrayOutput[20];


  int cmpfunc (const void * a, const void * b)
  {
    return ( *(double*)a - *(double*)b );
  }


int main(void){
  int k;
   printf("SORT AND UNIFY ARRAYS\n\n");
   printf("Prior to sorting arrayOne look like this ");
   for(k = 0; k < 6; ++k)
     printf("%.1f  ", arrayOne[k]);
   qsort(arrayOne, 6, sizeof(double), cmpfunc);
   printf("\n\nAfter sorting arrayOne looks like this ");
   for(k = 0; k < 6; k++)
     printf("  %3.1f", arrayOne[k]);


    return 0;
}

results from running it
SORT AND UNIFY ARRAYS


Prior to sorting arrayOne look like this 2.3 5.9 2.7 1.9 3.6 8.1


After sorting arrayOne looks like this 1.9 2.7 2.3 3.6 5.9 8.1

It functions now, thank you kind sir.

what is a new line character ?

Originally Posted by Barney McGrew

'\n'

I can do ASCII art as well. \o/ @}--'--,'---- (that's a flaming sword with an orb on the pommel)

This program works just fine now, thanks by the way but when i call my qsort i get the error, "passing argument 4 of 'qsort' from incompatible pointer type". I would like to hear if anyone knows why this happens.
Thanks for helping a beginner out!

Code:

#include <stdio.h>
#include <stdlib.h>
#define SIZE 5


  int cmpfunc (const int *element1 , const int *element2 ){
    if (*element1 > *element2)
      return 1;
    else if (*element1 < *element2)
      return -1;


    return 0;
  }




void arrayRemoveDuplicate(int array[], int *sizeAfter){
  int a, b, c, size = SIZE;
  for(a = 0; a < size; ++a){
    for(b = a + 1; b < size;){
      if(array[b] == array[a]){
        for(c = b; c < size; ++c)
          array[c] = array[c + 1];
          --size;
          (*sizeAfter -= 1);
      }
      else
      ++b;
    }
  }
}


int main(void){
  int k, sizeA = SIZE, array[SIZE];
  printf("Input integer elements for %d element array\n", SIZE);
  fflush(stdout);
  for(k = 0; k < SIZE; ++k)
    scanf("%d", &array[k]);
  arrayRemoveDuplicate(array, &sizeA);


  printf("After removing duplicates the array has %d elements and looks like this\n", sizeA);
  for(k = 0; k < sizeA; ++k)
    printf("%d   ", array[k]);
  printf("\nNow lets sort it in ascending order\n");
  qsort(array, sizeA, sizeof(int), cmpfunc);
  for(k = 0; k < sizeA; ++k)
    printf("%d  ", array[k]);




    return 0;
}