From 6c9f757c622e0a79d951f7dd24751c4bb42a6958 Mon Sep 17 00:00:00 2001 From: Shifa Date: Thu, 30 Jul 2026 10:07:05 +0000 Subject: [PATCH] modified search feature --- linkedlist | Bin 16224 -> 16224 bytes linkedlist.c | 6 +++--- linkedlist.h | 2 +- main.c | 9 ++++++--- 4 files changed, 10 insertions(+), 7 deletions(-) diff --git a/linkedlist b/linkedlist index 8079aa98bdb0952357c3f3b3a16cf164a6657d12..7c926d12868cdf2529f182d0552f94c98443e4dd 100755 GIT binary patch delta 973 zcmZvbUr19?9LLYOI^A75_fJg9c_!K{lIbLD?mj4T@h*f`Bt{TaXdu=4w>>DS4?=XA znRcM3q9OwKRZZ)Ix`B8#ii@W3hxJEf?&8iktDYN(OlN%9B1Y8a~0CD4oLy^?2G zn-w-dehtSJOumpE(g|6uaPG~o66ac{B!2^^L>|b*EX;%md2K2i*O`$mQnYlY4xGSV zl7mK_hR1L;wygyS4P#6QmeaLT`IgdW@DvasI!dbWBAq5>xP{IUH$F~RNSQAP1L|3R^Vtm?fpr81u%C@Yv*kM1 zR$Rb6C@M4}#PXA{mT0T160g(Ku1eQl7~b};wqKKK+9DXma(6cvfog9`~OE9_=37UgvAjJZ8@;m+^e|M_#y8D{R< z=-TL0E5}O(#8?tIxiIgb=E(sq+?;b>GEaL19}Nn*T{TZ=qc#6At2F48MYF^nVS!G& zAJ%n#h*$KvQbJX-=efN4@xs6{Em2TqzcE*W{`3`m%(+=~kwtzMb+E@2I~s`Y-!lD>sWBRc=;d%6E-yP~cu zV;~EqwS$;Z)Y!I?jBO{|H&us{^sI-l2c8wR)oQZnJ@gBnz)O}ubEej?6J^}<#)gfS z6?MgIM0a3D2!;p$8vUj*65AZI%yKwN#%oke9=94@$40iv&}aB9_~^k9cwGVZg*4f< zR0cPTYafV(_L5j{{A#=}Aztbq>g$FBVqF_oQ4noKACLQMR@ZMM136uPf^0-CA-j>i z$TQz`{R{Ff@)y#!rR$YANEcE@K0==3;IX*hm%~yuXd%rO2SWgNBkoQ}i9z20W(}F8 zaIp`QzpWx0ZJMsd@Ta2M#yOs zdata == value) { - return 1; + return temp; } temp = temp->next; } - return 0; + return NULL; } int count() diff --git a/linkedlist.h b/linkedlist.h index dd1d311..a0dac39 100644 --- a/linkedlist.h +++ b/linkedlist.h @@ -11,7 +11,7 @@ typedef struct Node void insert(int data); void display(); -int search(int value); +Node *search(int value); int count(); #endif diff --git a/main.c b/main.c index cd72d58..3bdac78 100644 --- a/main.c +++ b/main.c @@ -6,18 +6,21 @@ int main() insert(10); insert(20); insert(30); + printf("Linked List: "); display(); -if (search(20)) +Node *result = search(20); + if (result != NULL) { - printf("\nElement found\n"); + printf("\nElement found: %d\n", result->data); } else { printf("\nElement not found\n"); } - printf("Total nodes = %d\n", count()); + + printf("Total nodes = %d\n", count()); return 0; }