#include <iostream> #include <stack> #define MAX_SIZE...

代码说明：

非递归的快速排序算法-#include #include #define MAX_SIZE 11 using namespace std typedef int elem typedef std::stack Stack int partition(elem*pData, int low, int high) void swap(elem& a, elem& b) void qsort(elem* pData, int low, int high) int partition(elem*pData, int low, int high) { elem key = pData[low] while(low < high) { while(low < high && pData[high] >= key) high-- swap(pData[low], pData[high]) while(low < high && pData[low]