113. Searching and Sorting-I

Question.5

A developer uses recursive quicksort to sort 100 sensor samples in a data-processing task on an ARM Cortex-M0 with 2 KB stack:

void quicksort(int arr[], int low, int high) {
   if (low < high) {
       int pivot = partition(arr, low, high);
       quicksort(arr, low, pivot - 1);
       quicksort(arr, pivot + 1, high);
   }
}

Is this safe for the target platform?

Need Help? Refer to the Quick Guide below

Yes — quicksort is always the fastest and most efficient sorting algorithm
No — in the worst case, quicksort recurses O(n) deep (100 levels), and each call adds a stack frame; this can overflow a 2 KB stack
Yes — the compiler converts recursion to iteration automatically
No — but only because Cortex-M0 doesn't support function calls

Restart quiz!