The use of Fibonacci sequence and bubble sort in C language

One 、 Fibonacci series

First of all, let's briefly introduce what Fibonacci sequence is

C See the following code for the language implementation logic

#include <stdio.h>
int main()
{
    
    int arr[30] = {
    0};
    int i;
    int arraysize;
    arr[0] = 0;
    arr[1] = 1;
    arraysize = sizeof(arr)/sizeof(arr[0]);// Find out how many data there are in the array , In fact, that is 30 individual 
    for(i=2;i<arraysize;i++)
    {
    
        arr[i] = arr[i-1]+arr[i-2];   
    }
    for(i=0;i<arraysize;i++)
    {
    
          printf("%d\n",arr[i]);     
    }
    return 0;
}

Output the printed content as follows

0
1
1
2
3
5
8
13
21
34
55
89
144
233
377
610
987
1597
2584
4181
6765
10946
17711
28657
46368
75025
121393
196418
317811
514229

Two 、 bubble sort

The following is a ranking of the largest to the smallest

#include <stdio.h>
int main()
{
    
    int array[] = {
    1,3,4,5,2};
    int i;
    int j;
    int tmp;
    int len = sizeof(array)/sizeof(array[0]);// Calculate how many pieces of data there are in the array , Here is 5, The purpose of this is , The data to be sorted can be changed in real time 

    for(i=0;i<len-1;i++)// Two for The purpose of the loop is to pick out the largest number , To compare the smaller 
    {
    
        for(j=0;j<len-1-i;j++)
        {
    
            if(array[j] < array[j+1])// From small to large, change the less than sign to the greater than sign 
            {
    
                tmp = array[j];
                array[j] = array[j+1];
                array[j+1] = tmp;
            }
        }
    }
    for(i=0;i<len;i++)
    {
    
        printf("%d\n",array[i]);// Printout 
    }
    return 0;
}

Output results

5
4
3
2
1