Bubble sort to stack

[elvizzz22]

I need to change my bubble sort (void stekas) to something called stack. Thing is that in file there are numbers and I need to sort them to rising order. I did good with bubble sort, but I have no idea how I should do that using stack. Any ideas?

 #include <iostream>
#include <iomanip>
#include <fstream>
#include <cstdlib>

using namespace std;

void stekas(int a[], int N)
{
   int temp;
   for(int i = 0; i < N; i++)
	{
		for(int j=0; j < N - 1 -i; j++)
		{
		   if(a[j] > a[j+1])
			{
				temp=a[j];
				a[j]=a[j+1];
				a[j+1]=temp;
			}
		}
	}
}

int main()
{
	int i, j, temp, a[100];
	int N = 0;
	int value;
	
	ifstream file;

	char FailoVardas[100];
	cout << "Ivesk failo pavadinima: ";
	cin >>  FailoVardas;
	
	file.open (FailoVardas);
	
	if (!file.is_open())
        {
           cout << "Failas neatidarytas.... \n";
		   cin.get();
		   return 1;  
        }
        
	else
	{
		while (!file.eof())
	    {
		   file >> a[N];
		   N++;	
	    }
	}
        
    file.close();
	
  	
	cout << "\nPradiniai skaiciai \n";
	for( i = 0; i < N;  i++)
	{
		cout << a[i] << " " ;
	}

  	cout << endl;
  	
	stekas(a,N);	
	cout<<"\nDidejimo tvarka:\n ";
	for( i = 0; i < N;  i++)
	{
		cout<< a[i] << " ";
	}
	
	
    
    
    
return 0;		
}

[Thomas1965]

You can't sort a stack because you can access only the top element. What you could do is copy all the elements from the stack into the array, sort the array and copy the array elements from the array to the stack. However if you need the elements sorted a stack might not be right container.

Is there a reason why you don't use vector and std::sort ?

[elvizzz22]

No there isn't a reason. Also, I don't really understand what do you mean by copying it. :/

[Thomas1965]

Like this:

#include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  stack<int> s;
  vector<int>v;

  // create a unsorted stack 
  for (int i: {1, 5, 3, 7, 2})
    s.push(i);

  // bring the numbers into the vector
  while (!s.empty())
  {
    v.push_back(s.top());
    s.pop();
  }
  // sort the vector
  sort(v.begin(), v.end());

  // add the numbers from the vector to the stack

  for (int i: v)
    s.push(i);

  // stack now should be sorted
  while (!s.empty())
  {
    cout << s.top() << "\t";
    s.pop();
  }
}