sort与qsort的区别与联系

sort属于C++范畴,在algorithm头文件中,下面直奔主题,给大家一个清晰明了的认识.qsort有C,和C++两个版本.

qsort的compare函数原型 //comp ,也就说,如果the first < the second 返回-1,;如果the first > the second 返回1;如果the first == the second 返回0.,排序结果就表现为升序

comp

-

comparison function which returns ​a negative integer value if the first argument is less than the second, a positive integer value if the first argument is greater than the second and zero if the arguments are equal. The signature of the comparison function should be equivalent to the following: int cmp(const void *a, const void *b); The function must not modify the objects passed to it and must return consistent results when called for the same objects, regardless of their positions in the array.

 #include <algorithm>
 #include <functional>
 #include <array>
 #include <iostream>
 #include <limits.h>
 using namespace std;
 int cmpself(const void *a, const void *b){
     int arg1 = *static_cast<const int*>(a);
     int arg2 = *static_cast<const int*>(b);

     if(arg1 < arg2) return -;
     if(arg1 > arg2) return ;
     return ;
     //return arg1 < arg2;//如果将上面的改为这个呢?降序排列
     //return arg1 > arg2;//升序
 }
 int main()
 {
     //C++ sort 排序规则:前面元素大于后面元素,就返回降序结果;否则,返回升序结果.
     std::array<int, > s = {, , , , , , , , , };

     // sort using the default operator< sort默认升序排列
     std::sort(s.begin(), s.end());
     for (auto a : s) {
         std::cout << a << " ";
     }
     std::cout << '\n';

     // sort using a standard library compare function object
     //the former is greater than the later,降序排列
     std::sort(s.begin(), s.end(), std::greater<int>());
     for (auto a : s) {
         std::cout << a << " ";
     }
     std::cout << '\n';

     // sort using a custom function object
     struct {
         bool operator()(int a, int b)
         {
             return a < b;//升序排列
         }
     } customLess;
     std::sort(s.begin(), s.end(), customLess);
     for (auto a : s) {
         std::cout << a << " ";
     }
     std::cout << '\n';

     // sort using a lambda expression
     std::sort(s.begin(), s.end(), [](int a, int b) {
         return b < a;   //降序排列
     });
     for (auto a : s) {
         std::cout << a << " ";
     }
     std::cout << '\n';

     //c++ qsort
     int arr[] = {-, , , -, , INT_MIN+, };
     constexpr std::size_t elesize = sizeof(arr[]);
     constexpr std::size_t size = sizeof(arr) / sizeof(arr[]);

     std::qsort(arr, size, sizeof(arr[]), [](const void* a, const void* b)
     {
         int arg1 = *static_cast<const int*>(a);
         int arg2 = *static_cast<const int*>(b);
         //return arg1 < arg2; //error
         if(arg1 < arg2) return -;
         if(arg1 > arg2) return ;//需要注意的是,无论是C还是C++中的qsort,
         return ;

         //  return (arg1 > arg2) - (arg1 < arg2); // possible shortcut
         //  return arg1 - arg2; // erroneous shortcut (fails if INT_MIN is present)
     });

     for(int ai : arr)
         std::cout << ai << ' ';
     std::cout << '\n';
     std::qsort(arr, size, sizeof(arr[]), cmpself);
     for(int ai : arr)
         std::cout << ai << ' ';
     std::cout << '\n';
 }