In this program, we are going to find out the nth Fibonacci number. So let’s start!<\/p>\n\n\n\n
For example-<\/strong><\/p>\n\n\n\n Input<\/strong>–<\/p>\n\n\n\n First, we take input from the user to suppose we take 12<\/p>\n\n\n\n Logic-<\/strong><\/p>\n\n\n\n |Basically to find out the Fibonacci number, there is one formula to calculate these and the formula is:<\/p>\n\n\n\n Fn = Fn-1 + Fn-2<\/p>\n\n\n\n Output –<\/strong><\/p>\n\n\n\n According to our input, we take the output as<\/p>\n\n\n\n Enter a number: 12<\/p>\n\n\n\n The 12th Fibonacci number is 144<\/p>\n\n\n\n \/\/ C program to find nth fibonacci number.<\/p>\n\n\n\n #include <stdio.h><\/p>\n\n\n\n long fibonacci(int num) int main() printf(“nThe %dth fibonacci number is %ld”, num, fibonacci(num)); Output<\/strong><\/p>\n\n\n\n Enter a number: 12<\/p>\n\n\n\n The 12th Fibonacci number is 144<\/p>\n\n\n\n Steps to find out the nth Fibonacci number:<\/p>\n\n\n\n Step 1:<\/strong> Create a user-defined function.<\/p>\n\n\n\n Step 2:<\/strong> Apply the formula to find out the nth Fibonacci number<\/p>\n\n\n\n Fn = Fn-1 + Fn-2<\/p>\n\n\n\n Step 3:<\/strong> Create the main function<\/p>\n\n\n\n Step 4:<\/strong> Get a number from the user.<\/p>\n\n\n\n Step 5:<\/strong> return the value to the function.<\/p>\n\n\n\n Step 6:<\/strong> Execute the program.<\/p>\n\n\n\n So In this way, we simply calculate the nth Fibonacci number using the function. I hope this concept is clear to you. You can also explore these concepts by using another number.<\/p>\n\n\n\n Keep learning, and keep exploring!<\/p>\n","protected":false},"excerpt":{"rendered":" C program to find nth fibonacci number In this program, we are going to find out the nth Fibonacci number. So let’s start! For example- Input– First, we take input from the user to suppose we take 12 Logic- |Basically to find out the Fibonacci number, there is one formula to calculate these and the […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[30],"tags":[29,104],"class_list":["post-4593","post","type-post","status-publish","format-standard","category-c-program","tag-c-program","tag-c-program-to-find-nth-fibonacci-number"],"_links":{"self":[{"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/posts\/4593","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/comments?post=4593"}],"version-history":[{"count":1,"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/posts\/4593\/revisions"}],"predecessor-version":[{"id":4594,"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/posts\/4593\/revisions\/4594"}],"wp:attachment":[{"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/media?parent=4593"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/categories?post=4593"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/gyanipandit.com\/programming\/wp-json\/wp\/v2\/tags?post=4593"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
{
if (num <= 1)
return num;
return fibonacci(num – 1) + fibonacci(num – 2);
}<\/p>\n\n\n\n
{
int num;
printf(“Enter a number: “);
scanf(“%d”, &num);<\/p>\n\n\n\n
return 0;
}<\/p>\n\n\n\n