Project Remake!

[warshock10]

How will I fix the arrangement of numbers stored in an array?

#include <iostream>
#include <limits>
using namespace std;

int limit=0, c, i, shift, order, sum=0;
int*counter = new int[limit];

int limitFunction()
{
    while (!(cin >> limit))
    {
        cin.clear();
        cin.ignore(numeric_limits<streamsize>::max(),'\n');
        cout << "Error! Please try again.\n";
        cout << "How many integers will you sort? ";
    }
    return (limit);
}

int counterFunction()
{
    while (!(cin >> counter[c]))
    {
        cin.clear();
        cin.ignore(numeric_limits<streamsize>::max(),'\n');
        cout << "Error! Please try again.\n";
        cout << "Enter no. " << c+1 << ": ";
    }
    return (limit);
}

int AscendingFunction()
{
    cout << "Numbers in Ascending: ";
    {
        for (c=0;c<limit;c++)
        {
            cout << counter[c] << " ";
        }
    }
    cout << "\nTotal Sum: ";
    for (c=0;c<limit;c++)
    {
        sum+=counter[c];
    }
    cout << sum << " ";
    return (limit);
}

int DescendingFunction()
{
    cout << "Numbers in Descending: ";
    {
        for (c=0;c<limit;c++)
        {
            cout << counter[c] << " ";
        }
    }
        cout << "\nTotal Sum: ";
    for (c=0;c<limit;c++)
    {
        sum+=counter[c];
    }
    cout << sum << " ";
    return (limit);
}

int orderFunction()
{
    cout << "Choose Order: \n";
    cout << "[1]Ascending\n";
    cout << "[2]Descending\n";
    while(!(cin >> order))
    {
        cin.clear();
        cin.ignore(numeric_limits<streamsize>::max(),'\n');
        cout << "Error! Please try again.\n";
        cout << "Choose Order: \n";
        cout << "[1]Ascending\n";
        cout << "[2]Descending\n";
    }
    if (order==1)
    {
        for (c=0; c<limit; c++)
        {
            for (i=c+1; i<limit; i++)
            {
                if (counter[c]>counter[i])
                {
                    shift=counter[c];
                    counter[c]=counter[i];
                    counter[i]=shift;
                }
            }
        }
    AscendingFunction();
    }
    if (order==2)
    {
        for (c=0; c<limit; c++)
        {
            for (i=c+1; i<limit; i++)
            {
                if (counter[c]<counter[i])
                {
                    shift=counter[c];
                    counter[c]=counter[i];
                    counter[i]=shift;
                }
            }
        }
    DescendingFunction();
    }
    return (limit);
}

int main()
{
    cout << "How many integers will you sort? ";
    limit = limitFunction();
    
    for (c=0;c<limit;c++)
    {
        cout << "Enter no. " << c+1 << ": ";
        counter[c] = counterFunction();
    }
    orderFunction();
    delete[] counter;
    return (limit);
}

Sample output:

How many integers will you sort? 2
Enter no. 1: 1
Enter no. 2: 2
Choose Order:
[1]Ascending
[2]Descending
2

Numbers in Descending: 2 2
Exit code: 2

[jlb]

My first suggestion it that you git rid of all those global variables. Make the variables local to functions and pass the required values to and from your functions as required.

[AbstractionAnon]

Line 6: How many ints do you think are being allocated here? Hint: limit is 0.

Line 32,50: Other than the prompts, what is the difference between these two functions? Hint: none. So why have two different functions?

Lines 82-95,98-113: This is where you should have different functions.

Line 89-93, 105-109: This code is identical. Write a swap function or use std::swap.
http://www.cplusplus.com/reference/algorithm/swap/

Lines 8-18,20-30,70-81: Your input logic is nearly identical, except for the prompt. Consider writing a single function that accepts a prompt as an argument and returns an int value.

Lines 5-6: Get rid of the globals.

Line 129: Why is main() returning limit? main should return 0 if successful. A non-zero value tells the operating system that the program was not successful.