/* Lin An ENGIN: 135 */
/* Homework 15 */
/* This program will arrangea set of number in ascending order and detect
   how many times another integers, entered by the user,appear in the set. */


#include<iostream>
#include<fstream>
#include<iomanip>
using namespace std;


//declare function sort
void sort (int x[ ] , int );


int main ()
{

	int A[100];
	int B[100];
	int i(0) ,number , n , j(0) ;


	//declare infile
	ifstream infile ("in.txt");

	do
	{
		infile>>A[i];
		B[i] = A[i];
		i++;
	}while(A[i] != -999);

	number = i ;

	//call function
	sort ( A , number );

	for ( i=0;i<=number;i++ )
	{
		B[i+50] = A[i];
	}

	//output
	cout<<setw(10)<<"Array Element"<<setw(10)<<"Orginal values"<<setw(10)<<"Array element"<<setw(10)<<"Sorted values"<<endl;
	cout<<setw(10)<<"----- -------"<<setw(10)<<"------- ------"<<setw(10)<<"----- -------"<<setw(10)<<"------ ------"<<endl;

	for ( i=0;i<=number;i++ )
	{
		cout<<setw(10)<<"A["<<i<<"]"<<setw[10]<<" "<<setw(10)<<"A["<<(i+50)<<"]"<<setw(10)<<" "<<endl;
	}

	cout<<"Enter a integer number: ";
	cin>>n;
	for (i=0;i<=number;i++)
	{
		if(A[i] == n)
		{
			j++;
		}
		else
		{
			;
		}
	}

	cout<<"Message : Number is <<"<<j<<"Not in the set/in the set/#"<<endl;


	//close file and end program
	infile.close();
	return 0;

}


//define function
void sort (int A[ ],int number )
{
	int i, j , temp ;
	for( i=0 ; i<number+1 ; i++ ) 
	{
		for( j=0 ; j< number-i ; j++ )
		{
			if(A[i] > A[i+1] )
			{
				temp = A[j+1];
				A[j+1] = A[j];
				A[j] = temp ;
			}
		}
	}
}

1>------ Build started: Project: Homework 15, Configuration: Debug Win32 ------
1>Compiling...
1>HW115.cpp
1>c:\users\lin an\documents\c++\projects\project1\homework 15\homework 15\hw115.cpp(51) : error C2109: subscript requires array or pointer type
1>Build log was saved at "file://c:\Users\LIN AN\Documents\C++\Projects\Project1\Homework 15\Homework 15\Debug\BuildLog.htm"
1>Homework 15 - 1 error(s), 0 warning(s)
========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========

// Sometimes when you come into a familiar space, there is something...
// Wrong. Different from how it was the last you were here.
// But you just cannot seem to place what EXACTLY that is.
// Now think about this as one of those moments
do
	{
		infile>>A[i];
		B[i] = A[i];
		i++;
	}while(A[i] != -999);

	int A[100];
	int B[100];
	int i(0) ,number , n , j(0) ;


	//declare infile
	ifstream infile ("in.txt");

	do
	{
		infile>>A[i];
		B[i] = A[i];
		i++;
	}while(A[i] != -999);   // BIG PROBLEM

for (int i = 0; i < n; i++)
    A[i] = ...

#include<iostream>
#include<fstream>
/*If your homework really requires a sentinel*/
const char *filename = "in.txt";
enum Constants {
     SENTINEL = -999,
     MAX_ELEMENTS = 100,
	 
};
int main() {
    
	int elements[MAX_ELEMENTS] = { 0 };
	std::ifstream infile(filename);
	int number_of_elements = 0;
	if (infile.is_open()) { //Whether a valid file or not
	    int temp = 0;
		
		while (infile >> temp) {
			if (temp != SENTINEL && number_of_elements < MAX_ELEMENTS) {
			    elements[number_of_elements++] = temp;
			}
		}
		std::cout << "Number of elements read : " << number_of_elements; 
	    //Now the sorting part..
	}
	else {
		std::cout << "File not found";
	}
	return 0;
}