Breaking News: Grepper is joining You.com. Read the official announcement!

How to recursively sort the elements of a stack, in Python?

Wissam answered on July 18, 2022 Popularity 9/10 Helpfulness 4/10

answer How to recursively sort the elements of a stack, in Python?

How to recursively sort the elements of a stack, in Python?

Comment

"""
This implementation demonstrates how 
to recursively sort a stack in place.

Let n be the size of the stack.

Time complexity: O(n^2)
Space complexity: O(n)
"""
def sort_stack(stack):
    # base case
    if len(stack) == 0:
        return
    top_element = stack.pop()
    # Pop elements from stack
    sort_stack(stack)
    # Insert them in order into stack
    insert_in_order(stack, top_element)

def insert_in_order(stack, value):
    # Insert value at right position within stack
    if len(stack) == 0 or stack[len(stack)-1] <= value:
        stack.append(value)
        return

    top = stack.pop()
    # Same process all over again but one less element
    insert_in_order(stack, value)

    stack.append(top)
    
stack = [1, 4, 2, 3]
sort_stack(stack)
print("After sorting:", stack)  # After sorting: [1, 2, 3, 4]

Popularity 9/10 Helpfulness 4/10 Language python

Source: Grepper

Tags: elements python recursion stack using

Link to this answer
Share Copy Link

Contributed on Jul 18 2022

Wissam

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

How to recursively sort the elements of a stack, in Python?

Contents

More Related Answers

How to recursively sort the elements of a stack, in Python?

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.