int main(){
int i;
struct node *temp1, *temp2;
for (i = 0; i < 5; i++){
temp1 = numberToLinkedList(cases[i].in1, cases[i].len1);
temp2 = numberToLinkedList(cases[i].in2, cases[i].len2);
if (compare(merging_LinkedLists(temp1,temp2),numberToLinkedList(cases[i].out,cases[i].len3)))
printf("PASS\n");
else
printf("FAIL\n");
}
getchar();
}
int main(){
int i;
struct node *temp;
for (i = 0; i < 5; i++){
temp = numberToLinkedList(cases[i].in, cases[i].len1);
addNode(temp, cases[i].key, cases[i].number);
if (compare(temp, numberToLinkedList(cases[i].out, cases[i].len2)))
printf("PASS\n");
else
printf("FAIL\n");
}
getchar();
}
void main()
{
for (int i = 0; i < 5; i++){
median(numberToLinkedList(test[i].in));
}
getch();
}
void main()
{
struct node *head;
for (int i = 0; i < 5; i++) {
head = (struct node*)malloc(sizeof(struct node));
head = numberToLinkedList(test[i].in);
median(head,head,head);
}
getch();
}
void testInputCases()
{
int i;
struct node *head;
struct node *head11 = numberToLinkedList(135);
struct node *head12 = numberToLinkedList(246);
struct node *head21 = numberToLinkedList(1478);
struct node *head22 = numberToLinkedList(289);
struct node *head31 = numberToLinkedList(947);
struct node *head32 = numberToLinkedList(9892);
struct testcases
{
struct node *head1;
struct node *head2;
int result;
}test[3] = {
{ head11, head12, 381 },
{ head21, head22, 1767 },
{ head31, head32, 10839 }
};
for (i = 0; i<3; i++)
{
if (linkedListToNumber(getResult(test[i].head1, test[i].head2)) == test[i].result)
printf("pass\n");
else
printf("fail\n");
}
}
void main(){
for (int i = 0; i < 2; i++){
fix_list(numberToLinkedList(test[i].input));
}
_getch();
}
