Editorial Staff - - C Programming Tutorial
In this program, we are going to share a c program to search for an element in the linked list without using recursion.
If you are a beginner and want to start learning the C programming, then keep your close attention in this tutorial as I am going to share a C program to search for an element in the linked list without using recursion with the output.
We have designed this program for beginners for learning purpose. Copy below C program and execute it with c compiler to see the output of the program.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 | #include <stdio.h> #include <stdlib.h> struct node { int a; struct node *next; }; void generate(struct node **, int); void search(struct node *, int); void delete(struct node **); int main() { struct node *head = NULL; int key, num; printf("Enter the number of nodes: "); scanf("%d", &num); printf("\nDisplaying the list\n"); generate(&head, num); printf("\nEnter key to search: "); scanf("%d", &key); search(head, key); delete(&head); return 0; } void generate(struct node **head, int num) { int i; struct node *temp; for (i = 0; i < num; i++) { temp = (struct node *)malloc(sizeof(struct node)); temp->a = rand() % num; if (*head == NULL) { *head = temp; temp->next = NULL; } else { temp->next = *head; *head = temp; } printf("%d ", temp->a); } } void search(struct node *head, int key) { while (head != NULL) { if (head->a == key) { printf("key found\n"); return; } head = head->next; } printf("Key not found\n"); } void delete(struct node **head) { struct node *temp; while (*head != NULL) { temp = *head; *head = (*head)->next; free(temp); } } |
Enter the number of nodes: 10
Displaying the list
3 6 7 5 3 5 6 2 9 1
