C++快速排序算法代码分享

本篇内容介绍了"C++快速排序算法代码分享"的有关知识，在实际案例的操作过程中，不少人都会遇到这样的困境，接下来就让小编带领大家学习一下如何处理这些情况吧！希望大家仔细阅读，能够学有所成！

#include #include #include #include struct example{    int id;    std::string name;};template template bool intCheck(int a, int b){    return (a < b);}bool stringCheck(std::string a, std::string b){    for(int i = 0; i < a.length(); i++)        a[i] = tolower(a[i]);    for(int i = 0; i < b.length(); i++)        b[i] = tolower(b[i]);    if(strcmp(a.c_str(), b.c_str()) >= 0)        return false;    else return true;}bool exampleCheck(example a, example b){    if(strcmp(a.name.c_str(), b.name.c_str()) >= 0) return false;    else return true;}    int iArray[] = { 2, 1, 56, 213, 2, 32, 32216, 14 };    std::string sArray[] = { "Hello", "how are you?", "elephant", "aaah!", "zzzzz", "queen" };    example structArray[] = { {1, "Joe"},                              {4, "Billy"},                              {2, "Zander"},                              {3, "Tom"} };    quickSort(iArray, 0, 7, intCheck);    quickSort(sArray, 0, 5, stringCheck);    quickSort(structArray, 0, 3, exampleCheck);    std::cout << "Integers:" << std::endl;    for(int i = 0; i < 8;i++)        std::cout << 't' << iArray[i] << std::endl;    std::cout << std::endl << "String:" << std::endl;    for(int i = 0; i < 6;i++)        std::cout << 't' << sArray[i] << std::endl;    std::cout << std::endl << "Structure (By name):" << std::endl;    for(int i = 0; i < 4;i++)        std::cout << "t{ " << structArray[i].id << ", " << structArray[i].name << " }" << std::endl;    std::cin.get();    return 0;}template      int pos = l;     std::swap(uA[r], uA[pos]);     if (l < r){        std::swap(uA[r], uA[pos]);        }     return pos;}template      if(r > l){        int pos = partition( uA, l, r, less );        quickSort( uA, l, pos-1, less);        quickSort( uA, pos+1, r, less);     }}

"C++快速排序算法代码分享"的内容就介绍到这里了，感谢大家的阅读。如果想了解更多行业相关的知识可以关注网站，小编将为大家输出更多高质量的实用文章！