From ece0cbf8b1b2c193c048480d2ca7bdbf60c46008 Mon Sep 17 00:00:00 2001 From: Xtronix90 Date: Sat, 1 Apr 2023 19:18:21 +0530 Subject: [PATCH 1/2] aceeptance --- linear-search.c | 10 +++++++--- 1 file changed, 7 insertions(+), 3 deletions(-) diff --git a/linear-search.c b/linear-search.c index 45a6b8d..114a046 100644 --- a/linear-search.c +++ b/linear-search.c @@ -1,7 +1,11 @@ #include -void display() +void display(int* arr,int n) { - // display code goes here + for (int i = 0; i < n; i++) + { + printf("%d ",arr[i]); + } + } int linearSearch() { @@ -10,7 +14,7 @@ int linearSearch() int main() { int arr[] = {5, 3, 7, 9, 10, 12, 7, 2, 4}; - // main program + display(arr,9); return 0; } \ No newline at end of file From e3b19ef8e5f97202b39e4c0ab99c43d331fa07bd Mon Sep 17 00:00:00 2001 From: Xtronix90 Date: Sat, 1 Apr 2023 19:28:52 +0530 Subject: [PATCH 2/2] implemented both function --- linear-search.c | 16 ++++++++++++++-- 1 file changed, 14 insertions(+), 2 deletions(-) diff --git a/linear-search.c b/linear-search.c index 114a046..6c379f9 100644 --- a/linear-search.c +++ b/linear-search.c @@ -7,14 +7,26 @@ void display(int* arr,int n) } } -int linearSearch() +int linearSearch(int* arr,int target,int size) { - // linear search code goes here + int ans=-1; + for (int i = 0; i < size; i++) + { + if (arr[i]==target) + { + ans=i; + return i; + } + + } + return ans; + } int main() { int arr[] = {5, 3, 7, 9, 10, 12, 7, 2, 4}; display(arr,9); + int idx=linearSearch(arr,10,9); return 0; } \ No newline at end of file