Advertisement
LipAnn

Untitled

Sep 4th, 2015
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.77 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. enum
  5. {
  6.     MAX_SIZE = (size_t) 1023
  7. };
  8.  
  9. int
  10. comparator (const void *a, const void *b)
  11. {
  12.     if (*(const double *) a < *(const double *) b) {
  13.         return 1;
  14.     }
  15.     if (*(const double *) a > *(const double *) b) {
  16.         return -1;
  17.     }
  18.     return 0;
  19. }
  20.  
  21. int
  22. main(void)
  23. {
  24.     double input_arr[MAX_SIZE], sorted_arr[MAX_SIZE];
  25.     int n;
  26.  
  27.     scanf("%d", &n);
  28.     for (size_t i = 0; i < (size_t) n; ++i) {
  29.             scanf("%lf", input_arr + i);
  30.             sorted_arr[i] = input_arr[i];
  31.     }
  32.  
  33.     qsort(sorted_arr, (size_t) n, sizeof(*sorted_arr), comparator);
  34.  
  35.     for (size_t i = 0; i < (size_t) n; ++i){
  36.         printf("%d %.10g %10.g\n", (int) i + 1, input_arr[i], sorted_arr[i]);
  37.     }
  38.     return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement