Here is some code that works that has no flaws. I would like to be challenged to do something with it because it is too small.

// list_ETisdale

/*Written by Edward T. Tisdale
domain: linked to Geocities
with help from THE C++ STANDARD LIBRARY A Tutorial and Reference by Nicolai M. Josuttis.

#include <iostream>
#include <list>
#include <algorithm>

using namespace std;

/*void printLists (const list<int>& L)
int main()
list<int> L;
int array[10]={4,4,4,4,6,4,4,2,4,4,};
int i;
char response;
cout << "Two files do not belong. Put all files with code 4 away." << endl << endl;
for (i=0;i<10;i++)
cout << "Code:" << array[i] << endl;
cout << "Put in?(y/n)" << endl;
cin >> response;
if (response=='y')
else if(response=='n') i++;
else cout << "That is not a correct response." <<endl;
cout << "If all values you put in come from this list, then this is a correctly working linear linked list." << endl;
cout << "Here is the list from the front:" << endl;
copy (L.begin(),L.end(), ostream_iterator<int> (cout," "));
cout << endl << endl;
return 1;