재귀 없는 퀵정렬 소스코드

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778#include #include #include #define N 10000000#define R 100000#define STKSIZE N unsigned int arr[N]; int top = 0;int stack[STKSIZE]; void init_stack() { top = 0;} void push(int i) { if (top 0) { p = arr[r]; i = l - 1; j = r; while (1) { while (arr[++i]..