Sorting integer inputs by order

[zezimo]

I have to write a program that takes three integers as input and outputs the integers in order from least to greatest.

Here is a sample run as an example:

Enter three integers: 4, -2, 0
Sorted from least to greatest, the integers are -2, 0, 4

#include <iostream>

using namespace std;

void order3(int a, int b, int c);

int main()
{
	cout << "Enter three integers: ";
	int a, b, c;
	cin >> a >> b >> c;
	order3(a, b, c);
return 0;
}

I'm not sure how to define the "order3" function in my code. Please help.

[rorschach14]

There is already sort function in STD library

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

using namespace std;

int main()
{
    vector<int> vec;

    vec.push_back(2);
    vec.push_back(3);
    vec.push_back(1);

    cout<<"before sorting"<<endl;
    for(int i=0; i<vec.size(); i++)
        cout<<vec.at(i)<<"\t";

    sort(vec.begin(), vec.end());

    cout<<endl<<"after sorting"<<endl;
    for(int i=0; i<vec.size(); i++)
        cout<<vec.at(i)<<"\t";
}

[Dazzer]

This also works, for an explanation why, see here:

http://www.learncpp.com/cpp-tutorial/64-sorting-an-array-using-selection-sort

#include "stdafx.h"
#include <iostream>
#include <algorithm>


using namespace std;

void order3(int a, int b, int c)
{
	const int size = 3;
	int array[size] = { a,b,c };
	for (int count = 0; count < size; ++count)
	{
		int smallestIndex = count;
		for (int currentIndex = count + 1; currentIndex < size; ++currentIndex)
		{
			if (array[currentIndex] < array[smallestIndex])
				smallestIndex = currentIndex;
		}
		std::swap(array[count], array[smallestIndex]);
	}
	for (int index = 0; index < size; ++index)
		std::cout << array[index] << ' ';
}


int main()
{
	cout << "Enter three integers: ";
	int a, b, c;
	cin >> a >> b >> c;
	order3(a, b, c);
	return 0;
}