大家好,又见面了,我是你们的朋友全栈君。
c语言定义函数和声明函数
There can be 4 different types of user-defined functions, they are:
可以有4种不同类型的用户定义函数,它们是:
Below, we will discuss about all these types, along with program examples.
下面,我们将讨论所有这些类型以及程序示例。
Such functions can either be used to display information or they are completely dependent on user inputs.
这些功能可以用于显示信息,也可以完全取决于用户输入。
Below is an example of a function, which takes 2 numbers as input from user, and display which is the greater number.
下面是一个函数示例,该函数以2个数字作为用户输入,并显示较大的数字。
#include<stdio.h>
void greatNum(); // function declaration
int main()
{
greatNum(); // function call
return 0;
}
void greatNum() // function definition
{
int i, j;
printf("Enter 2 numbers that you want to compare...");
scanf("%d%d", &i, &j);
if(i > j) {
printf("The greater number is: %d", i);
}
else {
printf("The greater number is: %d", j);
}
}
We have modified the above example to make the function greatNum()
return the number which is greater amongst the 2 input numbers.
我们修改了上面的示例,以使函数greatNum()
返回2个输入数字中较大的数字。
#include<stdio.h>
int greatNum(); // function declaration
int main()
{
int result;
result = greatNum(); // function call
printf("The greater number is: %d", result);
return 0;
}
int greatNum() // function definition
{
int i, j, greaterNum;
printf("Enter 2 numbers that you want to compare...");
scanf("%d%d", &i, &j);
if(i > j) {
greaterNum = i;
}
else {
greaterNum = j;
}
// returning the result
return greaterNum;
}
We are using the same function as example again and again, to demonstrate that to solve a problem there can be many different ways.
我们一次又一次地使用与示例相同的功能,以说明解决问题的方法有很多种。
This time, we have modified the above example to make the function greatNum()
take two int
values as arguments, but it will not be returning anything.
这次,我们修改了上面的示例,以使函数greatNum()
接受两个int
值作为参数,但不会返回任何内容。
#include<stdio.h>
void greatNum(int a, int b); // function declaration
int main()
{
int i, j;
printf("Enter 2 numbers that you want to compare...");
scanf("%d%d", &i, &j);
greatNum(i, j); // function call
return 0;
}
void greatNum(int x, int y) // function definition
{
if(x > y) {
printf("The greater number is: %d", x);
}
else {
printf("The greater number is: %d", y);
}
}
This is the best type, as this makes the function completely independent of inputs and outputs, and only the logic is defined inside the function body.
这是最好的类型,因为这使函数完全独立于输入和输出,并且仅在函数体内定义了逻辑。
#include<stdio.h>
int greatNum(int a, int b); // function declaration
int main()
{
int i, j, result;
printf("Enter 2 numbers that you want to compare...");
scanf("%d%d", &i, &j);
result = greatNum(i, j); // function call
printf("The greater number is: %d", result);
return 0;
}
int greatNum(int x, int y) // function definition
{
if(x > y) {
return x;
}
else {
return y;
}
}
C language also allows nesting of functions i.e to use/call one function inside another function’s body. We must be careful while using nested functions, because it may lead to infinite nesting.
C语言还允许嵌套函数,即在另一个函数体内使用/调用一个函数。 使用嵌套函数时必须小心,因为它可能导致无限嵌套。
function1()
{
// function1 body here
function2();
// function1 body here
}
If function2() also has a call for function1() inside it, then in that case, it will lead to an infinite nesting. They will keep calling each other and the program will never terminate.
如果function2()中也有对function1()的调用,则在这种情况下,它将导致无限嵌套。 他们将继续互相调用,程序将永远不会终止。
Not able to understand? Lets consider that inside the main()
function, function1() is called and its execution starts, then inside function1(), we have a call for function2(), so the control of program will go to the function2(). But as function2() also has a call to function1() in its body, it will call function1(), which will again call function2(), and this will go on for infinite times, until you forcefully exit from program execution.
听不懂? 让我们考虑一下在main()
函数内部,调用了function1()并开始执行,然后在function1()内部,我们对function2()进行了调用,因此程序的控制权将移交给function2()。 但是由于function2()在其主体中也有对function1()的调用,它将调用function1(),后者将再次调用function2(),这将持续无数次,直到您强制退出程序执行为止。
Recursion is a special way of nesting functions, where a function calls itself inside it. We must have certain conditions in the function to break out of the recursion, otherwise recursion will occur infinite times.
递归是嵌套函数的一种特殊方式,其中函数在其中调用自身。 函数必须具有一定的条件才能中断递归,否则递归将无限次发生。
function1()
{
// function1 body
function1();
// function1 body
}
#include<stdio.h>
int factorial(int x); //declaring the function
void main()
{
int a, b;
printf("Enter a number...");
scanf("%d", &a);
b = factorial(a); //calling the function named factorial
printf("%d", b);
}
int factorial(int x) //defining the function
{
int r = 1;
if(x == 1)
return 1;
else
r = x*factorial(x-1); //recursion, since the function calls itself
return r;
}
Similarly, there are many more applications of recursion in C language. Go to the programs section, to find out more programs using recursion.
同样,在C语言中还有许多递归应用。 进入程序部分,使用递归查找更多程序。
翻译自: https://www.studytonight.com/c/type-of-functions-and-recursion.php
c语言定义函数和声明函数
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/150653.html原文链接:https://javaforall.cn