C Language algorithm

Select the sorting method: Compare the first number with the back number

　　　　

Bubble Sort method: two-digit comparison of adjacent

　　　　　　　　

01. Capitalize the first letter of the word & count the number of words

　　　　

02: Write a function int pieadd (int n) and calculate the value of 1!+2!+3!+......+n! (n>=1). For example, the return value of Pieadd (3) is 1! + 2! + 3! = 1 + 1*2 + 1*2*3 = 9.

　　　　

03-99 Multiplication Table

　　　　

04-Determine how many primes are between 101-200 and the number of primes and primes. Program Analysis: The method of judging primes: to remove 2 to sqrt (this number) with a number, if divisible, indicates that the number is not a prime, and vice versa is a prime.

　　　　

05-Rabbit Baby, the third number is the first two and. There are a pair of rabbits, from the 3rd month after the birth of a pair of rabbits every month, the small rabbit to the third month after the birth of a pair of rabbits, if the rabbit is not dead, ask each month the total number of rabbits?

The law of Rabbits is a series of 1,1,2,3,5,8,13,21....*

　　　　

06-String Sorting

　　　　

07: If a number is exactly equal to the sum of its factors, this number is called the "end number". For example, 6=1+2+3. Programming to find all the finished numbers within 1000.

　　　　

C Language algorithm