C# Sharp Stack Exercises: Sort the elements of a stack in ascending order
C# Sharp Stack: Exercise-3 with Solution
Write a C# program to sort the elements of a given stack in ascending order.
Sample Solution:
C# Code:
using System;
public class Stack
{
private int[] items;
private int top;
public Stack(int size)
{
items = new int[size];
top = -1;
}
public bool IsEmpty()
{
return top == -1;
}
public bool IsFull()
{
return top == items.Length - 1;
}
public void Push(int item)
{
if (IsFull())
{
Console.WriteLine("Stack Full!");
return;
}
items[++top] = item;
}
public int Pop()
{
if (IsEmpty())
{
Console.WriteLine("Stack underflow");
return -1;
}
return items[top--];
}
public int Peek()
{
if (IsEmpty())
{
Console.WriteLine("Stack is empty");
return -1;
}
return items[top];
}
public static int Size(Stack stack)
{
return stack.top + 1;
}
public static void SortAscending(Stack stack)
{
// Create a temporary stack to hold sorted elements
Stack temp = new Stack(stack.items.Length);
while (!stack.IsEmpty())
{
// Pop an element from the original stack
int curr = stack.Pop();
// Pop elements from the temporary stack and push them back onto the original stack
while (!temp.IsEmpty() && temp.Peek() > curr)
{
stack.Push(temp.Pop());
}
// Push the current element onto the temporary stack
temp.Push(curr);
}
// Copy the sorted elements back onto the original stack
while (!temp.IsEmpty())
{
stack.Push(temp.Pop());
}
}
public static void Display(Stack stack)
{
if (stack.IsEmpty())
{
Console.WriteLine("Stack is empty");
return;
}
Console.WriteLine("Stack elements:");
for (int i = stack.top; i >= 0; i--)
{
Console.Write(stack.items[i]+" ");
}
}
}
public class Program
{
public static void Main(string[] args)
{
Console.WriteLine("Initialize a stack:");
Stack stack = new Stack(10);
Console.WriteLine("Input some elements onto the stack:");
stack.Push(1);
stack.Push(3);
stack.Push(3);
stack.Push(9);
stack.Push(5);
Stack.Display(stack);
Stack.SortAscending(stack);
Console.WriteLine("\nStack elements in ascending order:");
Stack.Display(stack);
Console.WriteLine("\nInput two more elements onto the stack:");
stack.Push(0);
stack.Push(10);
Stack.Display(stack);
Console.WriteLine("\nStack elements in ascending order:");
Stack.SortAscending(stack);
Stack.Display(stack);
}
}
Sample Output:
Initialize a stack: Input some elements onto the stack: Stack elements: 5 9 3 3 1 Stack elements in ascending order: Stack elements: 1 3 3 5 9 Input two more elements onto the stack: Stack elements: 10 0 1 3 3 5 9 Stack elements in ascending order: Stack elements: 0 1 3 3 5 9 10
Flowchart:



C# Sharp Code Editor:
Improve this sample solution and post your code through Disqus
Previous: Sort the elements of a stack in descending order.
Next: Reverse the elements of a stack.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join
- JavaScript functions Exercises
- Python Tutorial
- Python Array Exercises
- SQL Cross Join
- C# Sharp Array Exercises