Lab2_P1_2/NumberList.cpp
void NumberList::Sort()
{
	int i, j;
	for (i = 0; i < this->count - 1; i++)
		for (j = i + 1; j < this->count; j++)
		{
			if (this->numbers[i] > this->numbers[j])
			{
				int aux = this->numbers[i];
				this->numbers[i] = this->numbers[j];
				this->numbers[j] = aux;
			}
		}
}
// adds X to the numbers list and increase the data member count.
// if count is bigger or equal to 10, the function will return false
adds X to the numbers list and increase the data member count.
if count is bigger or equal to 10, the function will return false
adds X to the numbers list and increase the data member count . if count is bigger or equal to 10 the function will return false
void NumberList::Sort()
{
	int i, j;
	for (i = 0; i < this->count - 1; i++)
		for (j = i + 1; j < this->count; j++)
		{
			if (this->numbers[i] > this->numbers[j])
			{
				int aux = this->numbers[i];
				this->numbers[i] = this->numbers[j];
				this->numbers[j] = aux;
			}
		}
}
void NumberList :: Sort ( ) { int i , j ; for ( i = 0 ; i < this -> count - 1 ; i ++ ) for ( j = i + 1 ; j < this -> count ; j ++ ) { if ( this -> numbers [ i ] > this -> numbers [ j ] ) { int aux = this -> numbers [ i ] ; this -> numbers [ i ] = this -> numbers [ j ] ; this -> numbers [ j ] = aux ; } } }
adds X to the numbers list and increase the data member count.
adds X to the numbers list and increase the data member count .