public:

Algorithm kadane;

Algorithm divCon;

Algorithm brute;

IntNode* next;

friend class IntLinkedList;

public:

IntLinkedList();

~IntLinkedList();

bool isEmpty()const;

const int num(); //prints front element

void addFront(const int& a, const int& b, const int& c);

void removeFront();

friend ostream& operator<<(ostream& out, const IntLinkedList& obj);

private:

IntNode* head;

IntNode* v = new IntNode;

v ->brute=a;

v ->divCon=b;

v ->kadane=c;

v ->next=head;

head =v;

IntNode* old =head;

head = old->next;

delete old;

IntLinkedList* data= new IntLinkedList();

ifstream input;

input.open("output.txt");

if(!input){

cerr<<"File Not Found"<<endl;

return -1;

}

int inputSize,alg1,alg2,alg3;

string firstLine;

getline(input,firstLine); //skips first line

input>>inputSize>>alg1>>alg2>>alg3;

while(input){

data ->addFront(alg1,alg2,alg3);

//cout<<alg1<<' '<<alg2<<' '<<alg3<<endl;

input>>inputSize>>alg1>>alg2>>alg3;

}

cout<< *data <<endl;

return 0;