From 8604d8f20ed7889d14cf884dd44756bc10586aa5 Mon Sep 17 00:00:00 2001 From: Jivan Dandapat Date: Fri, 14 Oct 2022 21:07:43 +0530 Subject: [PATCH 1/2] code of fibonacci search --- Searching/Fibonacci Search/fibonacci.c | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Searching/Fibonacci Search/fibonacci.c diff --git a/Searching/Fibonacci Search/fibonacci.c b/Searching/Fibonacci Search/fibonacci.c new file mode 100644 index 0000000..eb11eb5 --- /dev/null +++ b/Searching/Fibonacci Search/fibonacci.c @@ -0,0 +1,18 @@ +#include +main() +{ + int fib[10],i,n; + fib[0]=0; + fib[1]=1; + printf("enter thr value of n\n"); + scanf("%d",&n); + for(i=2;i Date: Sat, 15 Oct 2022 10:39:42 +0530 Subject: [PATCH 2/2] Rename fibonacci.c to in_C.c // Time Complexity of the program is O( n) // Space Complexity is O(1) --- Searching/Fibonacci Search/{fibonacci.c => in_C.c} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename Searching/Fibonacci Search/{fibonacci.c => in_C.c} (99%) diff --git a/Searching/Fibonacci Search/fibonacci.c b/Searching/Fibonacci Search/in_C.c similarity index 99% rename from Searching/Fibonacci Search/fibonacci.c rename to Searching/Fibonacci Search/in_C.c index eb11eb5..c9007bd 100644 --- a/Searching/Fibonacci Search/fibonacci.c +++ b/Searching/Fibonacci Search/in_C.c @@ -15,4 +15,4 @@ main() printf("\n %d",fib[i]); } return 0; -} \ No newline at end of file +}