Advertisement
lIlIlIlIIlI

Algorithms_Qsort

Sep 9th, 2019
144
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.58 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int sortof(const void* a, const void* b);
  5. // const 限制變數不能再賦值。 void 未定型態的指標。
  6. int sortof(const void* a, const void* b){
  7.     int *pa = (int* )a;
  8.     int *pb = (int* )b;
  9.     // (型態名稱)變數名稱 (int *)a  把 a 轉型 (cast) 成 int * 的型態。
  10.     if(*pa < *pb) return 1;
  11.     else if(*pa == *pb) return 0;
  12.     else return -1;
  13. }
  14.  
  15. int main(){
  16.     int arr[10] = {13, 20, 50, 32, 12, 63, 60, 44, 91, 3};
  17.     qsort( (void *) arr, 10, sizeof(int), sortof);
  18.     int i = 0;
  19.     for(i; i < 10; i++)
  20.         printf("%d ", arr[i] );
  21. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement