Sort Stack

Medium Stack: Advanced Applications PRO
🔒 Login to Unlock

Problem Statement

Write a C program to sort a stack in ascending order using recursion or an auxiliary stack.

Input Format

First line contains n. Second line contains n elements to push onto stack.

Output Format

Print the sorted stack from top to bottom separated by spaces.

Constraints

1 <= n <= 50

Sample Input

5
30 10 50 20 40

Sample Output

50 40 30 20 10

Explanation

Pop elements and insert them into a sorted position using an auxiliary stack or recursive insertion routine.

Starter Code

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to sort stack elements
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used