Stack overflow question. . . Assume that a computer system has a heap of 2GB and

Question

Stack overflow question.

.

.

Assume that a computer system has a heap of 2GB and that the size of the call stack for an application is 1MB. Quicksort is used to sort an array that is stored on the heap (i.e. it is stored in the computer's internal memory not on a file). Assume that each recursive call to quicksort requires 256 bytes to be allocated to the call stack. Explain why the call to quicksort will not result in a stack overflow regardless of the size of the array being sorted. You should assume that the call to quicksort results in the average case O Notation running time for the algorithm.

Explanation / Answer

Call to quicksort will not result in a stack overflow regardless of the size of the array being sorted. because quick sort is basically an in-place sorting algorithm ,which means we doesnot need (much more) memory locations to store the members of the array.So,basically here we only use pointers to store these elements size of the elements being sorted is irrelevant.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.