int main()
{
Table table;
List list;
BinaryHeap heap;
cout << "Program wykonuje operacje na tablicy, liscie oraz kopcu binarnym" << endl;
cout << "Elementu w tablicy numerowane sa od 0, natomiast w liscie od 1" << endl;
cout << "Prosze wprowadzac dane z zakresu [-99;99]" << endl << endl;
int whichStruct;
do{
cout << "wybierz strukture: " << endl;
cout << "[1] Tablica" << endl;
cout << "[2] Lista" << endl;
cout << "[3] Kopiec binarny" << endl;
cout << "[4] Koniec" << endl;
cin >> whichStruct;
switch (whichStruct)
{
case 1:
int whichOption;
do{
table.showContent();
cout << endl;
cout << "wybierz operacje: " << endl;
cout << "[1] Dodaj element na poczatku" << endl;
cout << "[2] Dodaj element na koncu" << endl;
cout << "[3] Dodaj element w wybranym miejscu" << endl;
cout << "[4] Usun pierwszy element" << endl;
cout << "[5] Usun ostatni element" << endl;
cout << "[6] Usun element w wybranym miejscu" << endl;
cout << "[7] Zmien rozmiar" << endl;
cout << "[8] Znajdz element" << endl;
cout << "[9] Pokaz zawartosc" << endl;
cout << "[10] Koniec" << endl;
cin >> whichOption;
switch (whichOption)
{
case 1:
table.addElementToTheBeginning();
break;
case 2:
table.addElementToTheEnd();
break;
case 3:
table.addElementSomewhere();
break;
case 4:
table.removeElementFromTheBeginning();
break;
case 5:
table.removeElementFromTheEnd();
break;
case 6:
table.removeElementFromSomewhere();
break;
case 7:
table.resize();
break;
case 8:
table.findElement();
break;
case 9:
cout << endl;
table.showContent();
cout << endl;
break;
case 10:
break;
default:
cout << "nie ma takiej opcji" << endl;
break;
}
} while (whichOption != 10);
break;
case 2:
int whichOption2;
do{
list.showContent();
cout << endl;
cout << "wybierz operacje: " << endl;
cout << "[1] Dodaj element na poczatku" << endl;
cout << "[2] Dodaj element na koncu" << endl;
cout << "[3] Dodaj element w wybranym miejscu" << endl;
cout << "[4] Usun pierwszy element" << endl;
cout << "[5] Usun ostatni element" << endl;
cout << "[6] Usun element w wybranym miejscu" << endl;
cout << "[7] Znajdz element po indeksie" << endl;
cout << "[8] Znajdz element po wartosci" << endl;
cout << "[9] Pokaz zawartosc" << endl;
cout << "[10] Pokaz zawartosc od konca" << endl;
cout << "[11] Koniec" << endl;
cin >> whichOption2;
switch (whichOption2)
{
case 1:
list.addElementToTheBeginning();
break;
case 2:
list.addElementToTheEnd();
break;
case 3:
list.addElementSomewhere();
break;
case 4:
list.removeFirstElement();
break;
case 5:
list.removeLastElement();
break;
case 6:
list.removeSomeElement();
break;
case 7:
list.findElement();
break;
case 8:
list.findElementValue();
break;
case 9:
cout << endl;
list.showContent();
cout << endl;
break;
case 10:
cout << endl;
list.showInverseContent();
cout << endl;
break;
case 11:
break;
default:
cout << "nie ma takiej opcji" << endl;
break;
}
} while (whichOption2 != 11);
break;
case 3:
int whichOption3;
do{
heap.draw();
cout << endl;
cout << "wybierz operacje: " << endl;
cout << "[1] Dodaj element" << endl;
cout << "[2] Usun korzen" << endl;
cout << "[3] Znajdz element" << endl;
cout << "[4] Koniec" << endl;
cin >> whichOption3;
switch (whichOption3)
{
case 1:
heap.addElement();
break;
case 2:
heap.removeRoot();
break;
case 3:
heap.findElement();
break;
case 4:
break;
default:
cout << "nie ma takiej opcji" << endl;
break;
}
} while (whichOption3 < 4);
case 4:
break;
break;
default:
cout << "nie ma takiej opcji" << endl;
break;
}
}while (whichStruct != 4);
system("PAUSE");
return 0;
}
