what code should i use?

[btickle1]

can someone help with the code to put these in ascending order?

  // Number Sorter
#include <iostream>


using namespace std;

char menu()
{
    char choice;
    cout<< "\nNumber Sorter - Created By Ben Tickle";
    cout<< "\n\n**************************************\n";
    cout<< "\n\n Please choose one of the following:\n";
    cout<< "\n\n 1 - Ascending order ";
    cout<< "\n 2 - Descending order ";
    cout<< "\n 3 - Exit";
    cout<< "\n\n\n**************************************\n";
    cout<< "\n\n Enter you choice and press return: ";
    cin >> choice;
    return choice;
}

int main()
{
    int a[5];
    
    
    char choice;
    
    do
    {
        choice = menu();
        
        switch (choice)
        {
            case '1':
                cout << "\n\nAscending order"
                     << "\n\n\nPlease enter 5 numbers include spaces:";
                
                cin >> a[0]; 
                cin >> a[1]; 
                cin >> a[2]; 
                cin >> a[3]; 
                cin >> a[4]; 

                for(int i=0;i<5;++i)
                cout<<a[i]<< ' '; 

                
                // Pause for user
                system("pause");
            break;             
            case '2':
                cout<< "\n\nDescending order"
                    << "\n\n\nPlease enter 5 numbers include spaces:";
                
                
                // Pause for user
                system("pause");
            break;
            case '3':
                cout<< "Exit"; 
                break;
            default:
                cout<< "\nNot a valid choice.";
        }
    } while (choice != '3');

    return 0;
} 

[snowright]

Simple algorithm for ordering an array is switching and solving for example the largest first, then second largest and so on. You basically work say from top to bottom and always compare current element to the one in the top and switch if current element is larger that the one in the top. Now that we got the largest element on top we do same but leave the top element as is and sort the array without the top element i.e. compare everything to the second element and switch if current element is larger than the second element in the array and then without two elements on the top and so on. Here is an example for you.

int a[ N ], temp;

for( int pos = 0; pos < N - 1; pos++ )
for( int e = pos + 1; e < N; e++ )
	if( a[ pos ] < a[ e ] )
	{
		temp = a[ e ];
		a[ e ] = a[ pos ];
		a[ pos ] = temp;
	}

Notice that ascending and descending order have no difference in an algorithmical way: you get both orders in the same array, descending order is just from the first element to last and ascending from last to first element. Well obviously you could turn the algorithm around so that you would get ascending from first to last if you replaced < with >.