C/C++数组学习（二）

void main()
{
int a[6] = { 6, 5, 4, 3, 2, 1 };
for (int i = 5; i >=0; i–)
{
printf(“%d”, a[i]);

}
system("pause");

}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<time.h>

void main()
{
    time_t ts;
    unsigned int data = time(&ts);
    srand(data);//创建随机数种子
    int a[100];
    for (int i = 0; i < 100; i++)
    {
        a[i] = rand() % 300;//创建随机数组
        printf("\n%d", a[i]);

    }
    int num;
    scanf("%d", &num);
    int flag = 0;
    for (int i = 0; i < 100; i++)
    {
        if (num == a[i]){
            flag = 1;
            break;
        }
    }
    if (flag)
    {
        printf("找到");
    }
    else
    {
        printf("没有找到");
    }
    system("pause");
}       

void main()
{
    time_t ts;
    unsigned int data = time(&ts);
    srand(data);
    int a[20];
    for (int i = 0; i < 20; i++)
    {
        a[i] = rand() % 300;
        printf("\n%d", a[i]);
    }
    //选择法
    int max = a[0];
    for (int i = 0; i < 20; i++)
    {
        if (a[i]>max){
            max = a[i];
        }
    }
    printf("\n最大值%d", max);
    system("pause");
}

#include<stdio.h>
#include<stdlib.h>
#include<time.h>

void show(int a[10][10])
{
    printf("===================\n");
    for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < 10; j++)
        {
            printf("%3d", a[i][j]);

        }
        printf("\n");

    }
}
void main()
{
    int a[10][10] = {0};
    show (a);
    int x;
    int y;
    x = 0;
    y = 0;
    a[x][y]=1;
    show(a);
    while (1)
    {
        char ch = getchar();
        getchar();

        switch (ch)
        {
        case 'a':
            if (y-1>=0)
            {
                int temp = a[x][y - 1];
                a[x][y - 1] = a[x][y];
                a[x][y] = temp;
                y = y - 1;
            }
            break;
        case 'd':
            if (y+1<=9)
            {
                int temp = a[x][y + 1];
                a[x][y + 1] = a[x][y];
                a[x][y] = temp;
                y = y + 1;
            }
            break;
        case 'w':
            if (x-1>=0)
            {
                int temp = a[x - 1][y];
                a[x -1][y] = a[x][y];
                a[x][y] = temp;
                x = x - 1;
            }
            break;
        case 's':
            if (x+1<=9)
            {
                int temp = a[x +1][y];
                a[x + 1][y] = a[x][y];
                a[x][y] = temp;
                x = x + 1;
            }
            break;
        default:
            break;
        }
        show(a);
    }
    system("pause");
}

#include<stdio.h>
#include<stdlib.h>
#include<time.h>

void show(int a[10][10])
{
    printf("===================\n");
    for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < 10; j++)
        {
            printf("%3d", a[i][j]);

        }
        printf("\n");

    }
}
void main()
{
    int a[10][10] = {0};
    show (a);
    int x;
    int y;
    x = 0;
    y = 0;
    a[x][y]=1;
    show(a);
    while (1)
    {
        char ch = getchar();
        getchar();

        switch (ch)
        {
        case 'a':
            if (y-1>=0 && a[x][y-1]!=2)
            {
                int temp = a[x][y - 1];
                a[x][y - 1] = a[x][y];
                a[x][y] = temp;
                y = y - 1;
            }
            break;
        case 'd':
            if (y + 1 <= 9 && a[x][y + 1] != 2)
            {
                int temp = a[x][y + 1];
                a[x][y + 1] = a[x][y];
                a[x][y] = temp;
                y = y + 1;
            }
            break;
        case 'w':
            if (x - 1 >= 0 && a[x-1][y] != 2)
            {
                int temp = a[x - 1][y];
                a[x -1][y] = a[x][y];
                a[x][y] = temp;
                x = x - 1;
            }
            break;
        case 's':
            if (x + 1 <= 9 && a[x +1][y] != 2)
            {
                int temp = a[x +1][y];
                a[x + 1][y] = a[x][y];
                a[x][y] = temp;
                x = x + 1;
            }
            break;
        default:
            break;
        }
        show(a);
    }
    system("pause");
}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define N 20
void search(int a[N], int num){
    int tou = 0;
    int wei = N - 1;
    int zhong;
    int flag = -1;
    int ci = 0;
    while (tou <= wei)
    {
        zhong = (tou + wei) / 2;
        printf("\n%d,%d,%d,%d", tou, wei, zhong, ++ci);
        if (num == a[zhong])
        {
            printf("找到 a[%d]=%d", zhong, num);
            flag = 1;
            break;
        }
        else if (num>a[zhong])
        {
            tou = zhong + 1;
        }
        else
        {
            wei = zhong - 1;
        }
    }
    if (flag == -1)
    {
        printf("没有找到");

    }
}

void main()
{
    int a[N];
    for (int  i = 0; i < N; i++)
    {
        a[i] = i;
        printf("%d ", i);
    }
    int num;
    scanf("%d", &num);
    search(a, num);
    system("pause"); 
}