-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSearch_list.c
More file actions
80 lines (75 loc) · 1.75 KB
/
Search_list.c
File metadata and controls
80 lines (75 loc) · 1.75 KB
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
79
80
//search and menu creation
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
struct node *create( struct node *head, int item)
{
struct node *ptr = (struct node *)malloc(sizeof(struct node));
if(ptr == NULL)
{
printf("memory not allocated \n");
}
else
{
ptr->data = item;
ptr->next = head;
head = ptr;
}
return head;
}
void search(struct node *head)
{
struct node *ptr=head;
int item, i = 0, flag = 1;
if(ptr == NULL)
{
printf("Empty List\n");
return;
}
printf("Enter item which you want to search?\n");
scanf("%d", &item);
while (ptr != NULL)
{
if(ptr->data == item)
{
printf("Item found at location %d \n", i + 1);
flag = 0;
}
i++;
ptr = ptr->next;
}
if(flag == 1)
{
printf("Item not found\n");
}
}
int main ()
{
struct node *head=NULL;
int choice, item;
do
{
printf("\n1. Create\n2. Search\n3. Exit\nEnter your choice: ");
scanf("%d", &choice);
switch(choice)
{
case 1:
printf("\nEnter the item: ");
scanf("%d", &item);
head=create(head, item);
break;
case 2:
search(head);
break;
case 3:
break;
default:
printf("\nPlease enter a valid choice\n");
}
} while(choice != 3);
return 0;
}