For the code below, draw a picture of the program stack when the function partition() is called the 2nd time.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 1TF
icon
Related questions
Question

2.     For the code below, draw a picture of the program stack when the function partition() is called the 2nd time.

 

# extracted from suquant's reply at

# https://stackoverflow.com/questions/18262306/quicksort-with-python

def partition(array, begin, end):

    pivot = begin

    for i in range(begin+1, end+1):

        if array[i] <= array[begin]:

            pivot += 1

            array[i], array[pivot] = array[pivot], array[i]

    array[pivot], array[begin] = array[begin], array[pivot]

    return pivot

 

def quicksort(array, begin, end):

    if begin >= end:

        return

    pivot = partition(array, begin, end)

    quicksort(array, begin, pivot-1)

    quicksort(array, pivot+1, end)

 

# added calling code

if __name__ == "__main__":

    mylist = [8, 2, 17, 4, 12]

    quicksort(mylist, 0, 4)

Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning