int main() {
// the list's name is "nodolista"
insertHead(&nodolista.next, 1);
insertTail(&nodolista.next, 6);
insertTail(&nodolista.next, 3);
insertTail(&nodolista.next, 8);
insertTail(&nodolista.next, 4);
insertTail(&nodolista.next, 7);
insertTail(&nodolista.next, 5);
insertTail(&nodolista.next, 9);
insertTail(&nodolista.next, 2);
// end
//printList
printList(nodolista.next);
//getHead
printf("\nHead:\t[ (%d) %d ]\n", getHead(nodolista.next)->index, getHead(nodolista.next)->info);
//getTail
printf("Tail:\t[ (%d) %d ]\n", getTail(nodolista.next)->index, getTail(nodolista.next)->info);
// getPrev
int k = 0;
printf("Insert an index to return the prev (starting from 0 to %d): ", getIndex(getTail(nodolista.next)));
scanf("%d", &k);
printf("The prev of value %d is: %d\n", getValue(nodolista.next, k)->info, \
(getPrev(nodolista.next, k) ? getPrev(nodolista.next, k)->info : 0));
// search
k = 0;
printf("Insert a value to search into the list: ");
scanf("%d", &k);
printf("The search went: %s\n", (search(nodolista.next, k) ? "true" : "false"));
// delete
printf("Insert an item in the list to delete: ");
scanf("%d", &k);
delete(nodolista.next, k);
printList(nodolista.next);
// inserction sort
inserctionSort(nodolista.next);
printList(nodolista.next);
return 0;
} //end main
int main(void) {
setvbuf(stdout, NULL, _IONBF, 0);
Header head;
head.head = NULL;
head.tail = NULL;
head.nodeCount = 0;
int menu = 0, list = 0;
do {
do {
system("cls");
printf("\n Manipular qual lista.\n");
printf("1 - Encadeada.\n");
printf("2 - Sequencial.\n");
scanf("%d", &list);
system("cls");
} while (list != 1 && list != 2);
system("cls");
printf("\n Digite o numero da opcao desejada.\n");
printf("1 - Inserir elemento no final da lista.\n");
printf("2 - Inserir elemento no inicio da lista.\n");
printf("3 - Remover elemento a partir de um valor.\n");
printf("4 - Imprimir a lista.\n");
printf("5 - Inserir na posicao N.\n");
printf("6 - Remover ultimo da lista.\n");
printf("7 - Remover primeiro da lista.\n");
printf("8 - Remover elemento na posicao N.\n");
printf("9 - Carregar lista do arquivo.\n");
printf("10 - Salvar lista atual em arquivo.\n");
printf("11 - Inserction.\n");
printf("12 - Selection.\n");
printf("13 - Bubble.\n");
printf("14 - Shell.\n");
printf("15 - Quick.\n");
printf("16 - Merge.\n");
printf("17 - Busca Binaria.\n");
printf("18 - Busca Seq.\n");
printf("20 - Sair.\n");
scanf("%d", &menu);
system("cls");
switch (menu) {
case 1:
if (list == 1) {
insertNodeAtTheEnd(&head, getValue(), 1);
reference(&head);
} else {
insertSeqAtTheEnd(getValue(), 1);
}
break;
case 2:
if (list == 1) {
insertNodeAtStart(&head, getValue(), 1);
reference(&head);
} else {
insertSeqAtStart(getValue(), 1);
}
break;
case 3:
if (list == 1) {
deleteNodeByValue(&head);
reference(&head);
} else {
deleteSeqByValue();
}
break;
case 4:
if (list == 1) {
printList(&head);
} else {
printSeq();
}
break;
case 5:
if (list == 1) {
insertAtN(&head, getValue(), getPosIns(&head));
reference(&head);
} else {
insertSeqAtN(getValue(), getPosSeqIns());
}
break;
case 6:
if (list == 1) {
deleteLastNode(&head, 1);
reference(&head);
} else {
deleteLastSeq(1);
}
break;
case 7:
if (list == 1) {
deleteFirstNode(&head, 1);
reference(&head);
} else {
deleteFirstSeq(1);
}
break;
case 8:
if (list == 1) {
deleteNodeAtN(&head, getPosDel(&head));
reference(&head);
} else {
deleteSeqAtN(getPosSeqDel(), 1);
}
break;
case 9:
listOptions(&head, list);
break;
case 10:
if (list == 1) {
writeLinkedList(&head);
} else {
writeSequentialList();
}
break;
case 11:
if (list == 1) {
linkedInserctionSort(&head);
} else {
inserctionSort();
}
break;
case 12:
if (list == 1) {
linkedSelectionSort(&head);
} else {
selectionSort();
}
;
break;
case 13:
if (list == 1) {
linkedBubbleSort(&head);
} else {
bubbleSort();
}
break;
case 14:
if (list == 1) {
linkedShellSort(&head);
} else {
shellSort();
}
break;
case 15:
if (list == 1) {
linkedCallQuickSort(&head);
} else {
callQuickSort();
}
break;
case 16:
if (list == 1) {
linkedCallMergeSort(head.nodeCount);
} else {
callMergeSort();
}
break;
case 17:
if (list == 1) {
linkedCallBynarySearch(&head);
} else {
callBynarySearch();
}
break;
case 18:
if (list == 1) {
searchNodeByValue(&head);
} else {
searchByValue();
}
break;
}
} while (menu != 20);
wipeList(&head);
return EXIT_SUCCESS;
}
