C language Merge two sets (L,L1) inserts elements in the L1 that are not in L into the L linear table

void Main ()
{

SqList l,l1;

Initlist (&L);
Initlist (&L1);

Listinsert (&l, 1, 2);
Listinsert (&l, 2, 3);
Listinsert (&l, 1, 1);

Listinsert (&l1,1,1);
Listinsert (&l1,2,2);
Listinsert (&l1,3,4);

for (int i = 0; I <L1.length; i++)
{
int flag = 0;

for (int j = 0; J < L.length; J + +)
{
if (l1.elem[i] = = L.elem[j]) {
flag = 1;
Break
}

}
if (!flag) {
Listinsert (&l, (l.length + 1), l1.elem[i]);
}

}
Output all values in the sequential list
for (int i = 0; i < l.length; i++)
{
printf ("The element%d value is%d\n", i + 1, l.elem[i]);

}
int del_e = 0;

Listdelete (&l, 3, del_e);

printf ("deleted element is%d\n", del_e);

printf ("Output deleted linear table \ n");

Output all values in the sequential list
/*for (int i = 0; i < l.length; i++)
{
printf ("The element%d value is%d\n", i + 1, l.elem[i]);

}*/

}

Time complexity of the algorithm F (N2)

C language Merge two sets (L,L1) inserts elements in the L1 that are not in L into the L linear table