Find the Length of the Linked List without using Recursion
#include
#include
#include
struct node
{
int a;
struct node *next;
};
void generate(struct node **);
int length(struct node*);
void delete(struct node **);
int main()
{
struct node *head = NULL;
int count;
clrscr();
generate(&head);
count = length(head);
printf("The number of nodes are: %d\n", count);
delete(&head);
return 0;
}
void generate(struct node **head)
{
int num = 10, i;
struct node *temp;
for (i = 0; i < num; i++)
{
temp = (struct node *)malloc(sizeof(struct node));
temp->a = i;
if (*head == NULL)
{
*head = temp;
(*head)->next = NULL;
}
else
{
temp->next = *head;
*head = temp;
}
}
}
int length(struct node *head)
{
int num = 0;
while (head != NULL)
{
num += 1;
head = head->next;
}
return num;
}
void delete(struct node **head)
{
struct node *temp;
while (*head != NULL)
{
temp = *head;
*head = (*head)->next;
free(temp);
}
}
Output
The number of nodes are: 10
Count the Occurrences of an Element in the Linked List without using
Recursion
#include
#include
int occur(int [], int, int);
int main()
{
int size, key, count;
int list[20];
int i;
clrscr();
printf("Enter the size of the list: ");
scanf("%d", &size);
printf("Printing the list:\n");
for (i = 0; i < size; i++)
{
list[i] = rand() % size;
printf("%d ", list[i]);
}
printf("\nEnter the key to find it's occurence: ");
scanf("%d", &key);
count = occur(list, size, key);
printf("%d occurs for %d times.\n", key, count);
return 0;
}
int occur(int list[], int size, int key)
{
int i, count = 0;
for (i = 0; i < size; i++)
{
if (list[i] == key)
{
count += 1;
}
}
return count;
}
Output
Enter the size of the list: 10
Printing the list:
3 6 7 5 3 5 6 2 9 1
Enter the key to find it's occurence: 3
3 occurs for 2 times.
No comments:
Post a Comment