Sorting Array

Hi, I need help in sorting numbers input by the use in ascending order. Here's what I have so far:

Code:

---

#include <cstdlib>
#include <iostream>
#include <algorithm>


using namespace std;

int main(int argc, char *argv[])
{
    int numbers[10];
    int i = 0;

   
    cout << "Enter 10 numbers: ";
    cin >> numbers[i];
   
    sort(numbers, numbers+i);
   
   
    for (int i = 0; i < 10; i++)
    {
        cout << numbers[i];
    }

   
    cout << "\n\nSorted numbers: " << numbers[i] << endl;
   
    system("PAUSE");
    return 0;
}

---

The output keeps coming out incorrect. Thank for the help! =]

Well, it looks like they are being entered incorrectly. Only the first number entered is actually placed into the numbers array.

The sort function operates on containers and only accepts iterators as arguments. If you want to sort an array, you have to come up with a function yourself. Otherwise, change your code to use a vector, for instance.

There's another problem in your code. You are only populating your array with 1 element. Not 10.

Code:

---

int counter = 0;
while (cin >> number && counter != 10) {
    myarray[counter++] = number;
}

---

that will populate your array correctly with up to 10 elements.

Quote:

---

The sort function operates on containers and only accepts iterators as arguments. If you want to sort an array, you have to come up with a function yourself. Otherwise, change your code to use a vector, for instance.

---

A C-style array is a sequential container, and a pointer is a random access iterator. eun-jin's idea will work, but the input part needs to be fixed. Currently the sort is just sorting one element.

Oh, and one might say std::sort (and various other generic algorithms) operates on a range, not on a container, since the container itself is left unmodified.

Quote:

---

Originally Posted by laserlight

A C-style array is a container, and a pointer is an iterator.

---

Ugh! Terribly sorry, for that.