C语言入门笔记 第六讲【函数-练习题】（*为存疑题）

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
int is_prime(int n)
{
    int j = 0;
    for (j = 2; j < n; j++)
    {
        if (n % j == 0)
            return 0;
    }

    return 1;
}



int main()
{
    int i = 0;
    for(i = 100;i <= 200;i++)
    {
        if (is_prime(i) == 1)
            printf("%dn", i);
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
int is_prime(int n)
{
    int j = 0;
    for (j = 2; j <= sqrt(n); j++)
    {
        if (n % j == 0)
            return 0;
    }

    return 1;
}

1
2
3
4
5
6
7
int is_leap_year(int y)
{
    if ((y % 4 == 0 && y % 100 != 0) || (y % 400 == 0))
        return 1;
    else
        return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
void bubble_sort(int v[],int length)
{
    for (int i = length; i > 1; --i)
    {
        for (int j = 0; j < i - 1; j++)
        {
            if (v[j] > v[j + 1])
            {
                int temp = 0;
                temp = v[j + 1];
                v[j + 1] = v[j];
                v[j] = temp;
            } 
        }
    }
}


int main()
{
    int arr[] = { 1,5,3,8,6,7,4 };
    const int length = sizeof(arr) / sizeof(arr[0]);
    bubble_sort(arr,length);
    for (int k = 0; k < 7; k++)
    {
        cout << arr[k] << endl;
    }
    return 0;

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
int binsearch(int x, int v[], int length)
{
    int left = 0;
    int right = length - 1;
    while (left <= right)
    {
        int mid = (left + right) / 2;
        if (x < v[mid])
        {
            right = mid - 1;
        }
        else if (x > v[mid])
        {
            left = mid + 1;
        }
        else
        {
            return 1;
        }
           
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
void add_num(int* x)
{
	(*x)++;
}
int main()
{
	int num = 0;
	cout << num;
	add_num(&num);
	cout << num;
	return 0;
}