请使用非递归算法实现快速排序。使用队列(循环队列)或者栈均可，要求队列或栈的长度为logN,其中N为数据规模。C语言

以下是使用栈实现快速排序的非递归算法，栈的长度为logN。

#include <stdio.h>
#include <stdlib.h>

#define MAX_N 100

typedef struct Stack {
    int start;
    int end;
} Stack;

void swap(int *a, int *b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}

int partition(int arr[], int start, int end) {
    int pivot = arr[end];
    int i = start - 1;

    for (int j = start; j < end; j++) {
        if (arr[j] <= pivot) {
            i++;
            swap(&arr[i], &arr[j]);
        }
    }

    swap(&arr[i + 1], &arr[end]);

    return i + 1;
}

void quick_sort(int arr[], int n) {
    Stack stack[MAX_N];
    int top = -1;

    stack[++top].start = 0;
    stack[top].end = n - 1;

    while (top >= 0) {
        int start = stack[top].start;
        int end = stack[top].end;
        top--;

        int pivot_index = partition(arr, start, end);

        if (pivot_index - 1 > start) {
            stack[++top].start = start;
            stack[top].end = pivot_index - 1;
        }

        if (pivot_index + 1 < end) {
            stack[++top].start = pivot_index + 1;
            stack[top].end = end;
        }
    }
}

int main() {
    int arr[] = {5, 3, 8, 4, 2, 7, 1, 10};
    int n = sizeof(arr) / sizeof(arr[0]);

    quick_sort(arr, n);

    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}