登录
首页 >  Golang >  Go教程

C语言的10大基础算法

来源:脚本之家

时间:2023-01-07 12:12:03 388浏览 收藏

对于一个Golang开发者来说,牢固扎实的基础是十分重要的,golang学习网就来带大家一点点的掌握基础知识点。今天本篇文章带大家了解《C语言的10大基础算法》,主要介绍了c语言算法,希望对大家的知识积累有所帮助,快点收藏起来吧,否则需要时就找不到了!

算法是一个程序和软件的灵魂,作为一名优秀的程序员,只有对一些基础的算法有着全面的掌握,才会在设计程序和编写代码的过程中显得得心应手。本文是近百个C语言算法系列的第二篇,包括了经典的Fibonacci数列、简易计算器、回文检查、质数检查等算法。也许他们能在你的毕业设计或者面试中派上用场。

1、计算Fibonacci数列

Fibonacci数列又称斐波那契数列,又称黄金分割数列,指的是这样一个数列:1、1、2、3、5、8、13、21。

C语言实现的代码如下:

/* Displaying Fibonacci sequence up to nth term where n is entered by user. */
#include <stdio.h>
int main()
{
int count, n, t1=0, t2=1, display=0;
printf("Enter number of terms: ");
scanf("%d",&n);
printf("Fibonacci Series: %d+%d+", t1, t2); /* Displaying first two terms */
count=2; /* count=2 because first two terms are already displayed. */
while (count<n display="t1+t2;" t1="t2;" t2="display;" printf return><p>结果输出:</p>

<pre class="brush:cpp;">
Enter number of terms: 10
Fibonacci Series: 0+1+1+2+3+5+8+13+21+34+

也可以使用下面的源代码:

/* Displaying Fibonacci series up to certain number entered by user. */

#include <stdio.h>
int main()
{
int t1=0, t2=1, display=0, num;
printf("Enter an integer: ");
scanf("%d",&num);
printf("Fibonacci Series: %d+%d+", t1, t2); /* Displaying first two terms */
display=t1+t2;
while(display<num printf t1="t2;" t2="display;" display="t1+t2;" return><p>结果输出:</p>
<blockquote>
<p>Enter an integer: 200<br>
Fibonacci Series: 0+1+1+2+3+5+8+13+21+34+55+89+144+</p>
</blockquote>
<p><span style="color: #ff0000"><strong>2、回文检查</strong></span></p>
<p> 源代码:</p>

<pre class="brush:cpp;">
/* C program to check whether a number is palindrome or not */

#include <stdio.h>
int main()
{
int n, reverse=0, rem,temp;
printf("Enter an integer: ");
scanf("%d", &n);
temp=n;
while(temp!=0)
{
rem=temp%10;
reverse=reverse*10+rem;
temp/=10;
} 
/* Checking if number entered by user and it's reverse number is equal. */ 
if(reverse==n) 
printf("%d is a palindrome.",n);
else
printf("%d is not a palindrome.",n);
return 0;
}</stdio.h>

结果输出:

Enter an integer: 12321
12321 is a palindrome.

3、质数检查

注:1既不是质数也不是合数。

源代码:

/* C program to check whether a number is prime or not. */

#include <stdio.h>
int main()
{
int n, i, flag=0;
printf("Enter a positive integer: ");
scanf("%d",&n);
for(i=2;i

<p>结果输出:</p>
<blockquote>
<p>Enter a positive integer: 29<br>
29 is a prime number.</p>
</blockquote>
<p><span style="color: #ff0000"><strong>4、打印金字塔和三角形</strong></span></p>
<p> 使用 * 建立三角形</p>
<p>*<br>
* *<br>
* * *<br>
* * * *<br>
* * * * *<br></p>
<p>源代码:</p>

<pre class="brush:cpp;">
#include <stdio.h>
int main()
{
int i,j,rows;
printf("Enter the number of rows: ");
scanf("%d",&rows);
for(i=1;i

<p>如下图所示使用数字打印半金字塔。</p>
<p>1<br>
1 2<br>
1 2 3<br>
1 2 3 4<br>
1 2 3 4 5<br></p>
<p>源代码:</p>

<pre class="brush:cpp;">
#include <stdio.h>
int main()
{
int i,j,rows;
printf("Enter the number of rows: ");
scanf("%d",&rows);
for(i=1;i

<p>用 * 打印半金字塔</p>
<p>* * * * *<br>
* * * *<br>
* * * <br>
* *<br>
*</p>
<p>源代码:</p>

<pre class="brush:cpp;">
#include <stdio.h>
int main()
{
int i,j,rows;
printf("Enter the number of rows: ");
scanf("%d",&rows);
for(i=rows;i>=1;--i)
{
for(j=1;j

<p>用 * 打印金字塔</p>
<p>*<br>
* * *<br>
* * * * *<br>
* * * * * * *<br>
* * * * * * * * *</p>
<p>源代码:</p>

<pre class="brush:cpp;">
#include <stdio.h>
int main()
{
int i,space,rows,k=0;
printf("Enter the number of rows: ");
scanf("%d",&rows);
for(i=1;i

<p>用 * 打印倒金字塔</p>
<p>* * * * * * * * *<br>
* * * * * * *<br>
* * * * *<br>
* * *<br>
*</p>
<p>源代码:</p>
<p></p>

<pre class="brush:cpp;">
#include<stdio.h>
int main()
{
int rows,i,j,space;
printf("Enter number of rows: ");
scanf("%d",&rows);
for(i=rows;i>=1;--i)
{
for(space=0;space<rows-i printf for return><p>5、简单的加减乘除计算器</p>
<p>源代码:</p>

<pre class="brush:cpp;">
/* Source code to create a simple calculator for addition, subtraction, multiplication and division using switch...case statement in C programming. */

# include <stdio.h>
int main()
{
char o;
float num1,num2;
printf("Enter operator either + or - or * or divide : ");
scanf("%c",&o);
printf("Enter two operands: ");
scanf("%f%f",&num1,&num2);
switch(o) {
case '+':
printf("%.1f + %.1f = %.1f",num1, num2, num1+num2);
break;
case '-':
printf("%.1f - %.1f = %.1f",num1, num2, num1-num2);
break;
case '*':
printf("%.1f * %.1f = %.1f",num1, num2, num1*num2);
break;
case '/':
printf("%.1f / %.1f = %.1f",num1, num2, num1/num2);
break;
default:
/* If operator is other than +, -, * or /, error message is shown */
printf("Error! operator is not correct");
break;
}
return 0;
}</stdio.h>

结果输出:

Enter operator either + or - or * or divide : -
Enter two operands: 3.4
8.4
3.4 - 8.4 = -5.0

6、检查一个数能不能表示成两个质数之和

源代码:

#include <stdio.h>
int prime(int n);
int main()
{
int n, i, flag=0;
printf("Enter a positive integer: ");
scanf("%d",&n);
for(i=2; i

<p>结果输出:</p>
<blockquote>
<p>Enter a positive integer: 34<br>
34 = 3 + 31<br>
34 = 5 + 29<br>
34 = 11 + 23<br>
34 = 17 + 17</p>
</blockquote>
<p>7、用递归的方式颠倒字符串</p>
<p>源代码:</p>

<pre class="brush:cpp;">
/* Example to reverse a sentence entered by user without using strings. */

#include <stdio.h>
void Reverse();
int main()
{
printf("Enter a sentence: ");
Reverse();
return 0;
}
void Reverse()
{
char c;
scanf("%c",&c);
if( c != '\n')
{
Reverse();
printf("%c",c);
}
}</stdio.h>

结果输出:

Enter a sentence: margorp emosewa
awesome program

8、实现二进制与十进制之间的相互转换

/* C programming source code to convert either binary to decimal or decimal to binary according to data entered by user. */
#include <stdio.h>
#include <math.h>
int binary_decimal(int n);
int decimal_binary(int n);
int main()
{
int n;
char c;
printf("Instructions:\n");
printf("1. Enter alphabet 'd' to convert binary to decimal.\n");
printf("2. Enter alphabet 'b' to convert decimal to binary.\n");
scanf("%c",&c);
if (c =='d' || c == 'D')
{
printf("Enter a binary number: ");
scanf("%d", &n);
printf("%d in binary = %d in decimal", n, binary_decimal(n));
}
if (c =='b' || c == 'B')
{
printf("Enter a decimal number: ");
scanf("%d", &n);
printf("%d in decimal = %d in binary", n, decimal_binary(n));
}
return 0;
}
int decimal_binary(int n) /* Function to convert decimal to binary.*/
{
int rem, i=1, binary=0;
while (n!=0)
{
rem=n%2;
n/=2;
binary+=rem*i;
i*=10;
}
return binary;
}
int binary_decimal(int n) /* Function to convert binary to decimal.*/
{
int decimal=0, i=0, rem;
while (n!=0)
{
rem = n%10;
n/=10;
decimal += rem*pow(2,i);
++i;
}
return decimal;
}</math.h></stdio.h>

结果输出:

9、使用多维数组实现两个矩阵的相加

源代码:

#include <stdio.h>
int main(){
int r,c,a[100][100],b[100][100],sum[100][100],i,j;
printf("Enter number of rows (between 1 and 100): ");
scanf("%d",&r);
printf("Enter number of columns (between 1 and 100): ");
scanf("%d",&c);
printf("\nEnter elements of 1st matrix:\n");
/* Storing elements of first matrix entered by user. */
for(i=0;i<r for printf element a scanf storing elements of second matrix entered by user. matrix: two matrices sum displaying the resultant matrix. is: if return><p>10、矩阵转置</p>
<p>源代码:</p>

<pre class="brush:cpp;">
#include <stdio.h>
int main()
{int a[10][10], trans[10][10], r, c, i, j;
printf("Enter rows and column of matrix: ");
scanf("%d %d", &r, &c);
/* Storing element of matrix entered by user in array a[][]. */
printf("\nEnter elements of matrix:\n");
for(i=0; i<r for j printf elements a scanf displaying the matrix matrix: i if finding transpose of and storing it in array trans return><p><span style="color: #ff0000"><strong>总结</strong></span></p>
<p>以上所述是小编给大家介绍的C语言的10大基础算法,希望对大家有所帮助,如果大家有任何疑问请给我留言,小编会及时回复大家的。在此也非常感谢大家对golang学习网网站的支持!<br>
如果你觉得本文对你有帮助,欢迎转载,烦请注明出处,谢谢!</p><p>今天关于《C语言的10大基础算法》的内容介绍就到此结束,如果有什么疑问或者建议,可以在golang学习网公众号下多多回复交流;文中若有不正之处,也希望回复留言以告知!</p></r></stdio.h>
声明:本文转载于:脚本之家 如有侵犯,请联系study_golang@163.com删除
相关阅读
更多>
最新阅读
更多>
课程推荐
更多>
评论列表