c - C中数组的QSORT？

Question

如果我有这样的数组:

2, 4, 6, 0, 0, 0, 0, 0, 0

1. Is there a way I can use qsort by sorting just the first 3 elements, and leaving the rest untouched?
2. Would qsort(arrNumbers, 3, sizeof(int), compare) do the job?
3. Does specifying the number of elements lower than the full array cause only that number of elements to become sorted?

EDIT:My compare function is:

int comp(const int * a, const int * b)
   if(a==b)
   {
       return 0;
   }
   else
   {
      if(a<b)
      {
         return -1;
       }
       else
       {
         return 1;
       }
    }

看起来对吗？

Answer 1

是的。

是的。^*

是的。

---

_{* 假设您适本地定义了 compare()。}