mirror of
https://github.com/ada-dmitry/prog.l_ada.git
synced 2026-09-24 01:00:15 +00:00
30 lines
698 B
C
30 lines
698 B
C
#include "lib.h"
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <time.h>
|
|
#include <stdlib.h>
|
|
|
|
int main(int argc, char *argv[]){
|
|
|
|
node *head = NULL,*head2 = NULL, *head3 = NULL;
|
|
pointer *addresses = NULL;
|
|
int r;
|
|
|
|
srand(time(NULL));
|
|
|
|
printf("Generated linked list (method of head)\n");
|
|
while ((r=(rand()%100)) < 75) head = add_head(head, r);
|
|
pr(head);
|
|
|
|
printf("Length of linked list is: %d\n", length(head));
|
|
|
|
printf("Sorted linked list\n");
|
|
sort(head);
|
|
pr(head);
|
|
addresses = add_head_address(addresses, &head3);
|
|
addresses = add_head_address(addresses, &head2);
|
|
addresses = add_head_address(addresses, &head);
|
|
hanoi_tower(length(head), &head, &head3, &head2, addresses);
|
|
return 0;
|
|
}
|