int main() {
LinkList l;
l = init(5);
printLink(l);
insertEle(l, 6, 10);
printLink(l);
delNode(l, 2);
printLink(l);
updateNode(l, 5, 22);
printLink(l);
return 0;
}
int main(void) {
puts("!!!Hello World!!!"); /* prints !!!Hello World!!! */
LinkList l;
l = init(5);
printLink(l);
insertEle(l, 6, 10);
printLink(l);
delNode(l, 2);
printLink(l);
updateNode(l, 6, 22);
printLink(l);
printf("this is a test for list by c./n");
return EXIT_SUCCESS;
}
int main(int argc, const char * argv[])
{
int a1[]={13,0,5,8,1,7,21,50,9,2};
int a[num];
// int count=0;
for (int i=0; i<num-1; i++) {
for (int j=0; j<num-i-1; j++) {
if (a[j]>a[j+1])
{
int tmp=a[j];
a[j]=a[j+1];
a[j+1]=tmp;
}
}
}
printf("The result of factorial caculation is:%d\n",factorialCaculation(6));
printf("\nThe Origonal is:\n");
printArray(a1, 10);
printf("The sorted Array:\n");
bubble(a1, 10);
printArray(a1, 10);
LinkList l;
l = init(5);
printf("\nThe Original list:\n");
printLink(l);
insertEle(l, 6, 10);
printf("Inserted at end:\n");
printLink(l);
insertEle(l, 1, 0);
printf("Inserted at start:\n");
printLink(l);
insertEle(l, 4, 2);
printf("Inserted at middle:\n");
printLink(l);
delNode(l, 2);
printf("The second num deleted:\n");
printLink(l);
return 0;
}
