List C++ implementation

#include<iostream.h>
#include"class.h"
List::List()
{
	numberOfElements=0;
	currentPostion=-1;
}
void List::insert(const  ListElementType &elem)
{
	int i;
	 
	 
	for(i=numberOfElements;i>0&&listArray[i-1]>elem&&numberOfElements>0;i--)
	{	 
		listArray[i]=listArray[i-1]; 
	}		 
	listArray[i]=elem;
  	numberOfElements++;
	 
     

  	 
     
}
bool List::first(ListElementType &elem)
{
	if(numberOfElements==0)
		return false;
     
	currentPostion=0;
	elem=listArray[currentPostion];

	return true;
}
bool List::next(ListElementType &elem)
{
	if(currentPostion>=numberOfElements-1) return false;

	currentPostion++;
	elem=listArray[currentPostion];
	return true;
}

#include<iostream.h>
#ifndef class_H
#define class_H
const int maxListSize=1000;
typedef int ListElementType;

class List
{
public:
	List();
	void insert(const ListElementType &elem);
	bool first(ListElementType &elem);
	bool next(ListElementType &elem);
 
private:
	ListElementType listArray[maxListSize];
	int numberOfElements;
	int currentPostion;
};
#endif

#include<iostream.h>
#include"class.h"
#include"class.h"
void main()
{
	List L;
	ListElementType i;
	cout<<"Enter items to add to list,add 0 to stop "<<endl;
		cin>>i;
	while(i!=0)
	{
		L.insert(i);
			cin>>i;
	}
	cout<<"Here are the items in the list.\n";
	ListElementType elem;
	bool notEmpty(L.first(elem));
	while(notEmpty)
	{
		cout<<elem<<',';
		notEmpty=L.next(elem);
	}
	cout<<endl;
}