﻿ C++ Sort the stack (using a vector) elements

# C++ Stack Exercises: Sort the stack (using a vector) elements

## C++ Stack: Exercise-25 with Solution

Write a C++ program that sorts the stack (using a vector) elements.

Test Data:
Create a stack object:
Input and store (using vector) some elements onto the stack:
Stack elements are: 1 3 2 6 5 -1 0
Sort the stack items in ascending order:
Stack elements are: -1 0 1 2 3 5 6

Sample Solution:

C++ Code:

``````#include <iostream>
#include <vector>
#include<algorithm>

using namespace std;

class Stack {
private:
// Vector to store elements
vector<int> elements;

public:
void push(int element) {
elements.push_back(element);
}

void pop() {
if (elements.empty()) {
cout << "Stack is full" << endl;
} else {
// Remove last element from vector
elements.pop_back();
}
}

int top() {
if (elements.empty()) {
cout << "Stack is empty" << endl;
return 0;
} else {
// Return last element in vector
return elements.back();
}
}

bool empty() {
// Check if vector is empty
return elements.empty();
}

void sort_elements(){
if (elements.empty()) {
cout << "Stack is empty" << endl;
return;
}

// sort elements in ascending order
sort(elements.begin(), elements.end());

}

void display() {
vector<int> v = elements;
if (v.empty()) {
cout << "Stack is empty" << endl;
return;
}
cout << "Stack elements are: ";
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
};

int main() {
Stack stack;
//Initialize a stack
cout << "Create a stack object:\n";
cout << "\nInput and store (using vector) some elements onto the stack:\n";
stack.push(1);
stack.push(3);
stack.push(2);
stack.push(6);
stack.push(5);
stack.push(-1);
stack.push(0);
stack.display();
cout << "\nSort the stack items in ascending order:\n";
stack.sort_elements();
stack.display();
cout << "\nRemove two elements from the stack:\n";
stack.pop();
stack.pop();
stack.display();
cout << "\nInput three elements onto the stack:\n";
stack.push(4);
stack.push(7);
stack.push(-2);
stack.display();
cout << "\nSort the said items in ascending order:\n";
stack.sort_elements();
stack.display();
return 0;
}
``````

Sample Output:

```Create a stack object:

Input and store (using vector) some elements onto the stack:
Stack elements are: 1 3 2 6 5 -1 0

Sort the stack items in ascending order:
Stack elements are: -1 0 1 2 3 5 6

Remove two elements from the stack:
Stack elements are: -1 0 1 2 3

Input three elements onto the stack:
Stack elements are: -1 0 1 2 3 4 7 -2

Sort the said items in ascending order:
Stack elements are: -2 -1 0 1 2 3 4 7
```

Flowchart:   CPP Code Editor: