自学内容网 自学内容网

一维数组的应用举例

                      Hi~!这里是奋斗的小羊,很荣幸各位能阅读我的文章,诚请评论指点,关注+收藏,欢迎欢迎~~     

                        💥个人主页小羊在奋斗

                        💥所属专栏C语言   

        本系列文章为个人学习笔记,在这里撰写成文一为巩固知识,二为同样是初学者的学友展示一些我的学习过程及心得。文笔、排版拙劣,望见谅。

1、

【二分查找】

#include <stdio.h>          //【函数版】

int binary_serach(int* arr, int i, int sz)
{
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] < i)
{
left++;
}
else if (arr[mid] > i)
{
right--;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)
{
printf("找不到\n");
}
}

int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int sz = sizeof(arr) / sizeof(arr[0]);
int i = 0;
printf("请输入想要查找的数:");
scanf("%d", &i);
binary_serach(arr, i, sz);
return 0;
}

#include <stdio.h>        //【函数版】

int binary_serach(int arr[], int i, int sz)
{
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] < i)
{
left++;
}
else if (arr[mid] > i)
{
right--;
}
else
{
return mid;
}
}
return -1;
}

int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int sz = sizeof(arr) / sizeof(arr[0]);
int i = 0;
scanf("%d", &i);//输入想要查找的数
int ret = binary_serach(arr, i, sz);
if (ret == -1)
{
printf("没有找到\n");
}
else
{
printf("找到了,下标是:%d\n", ret);
}
return 0;
}


#include <stdio.h>         //【常规版】

int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
int i = 0;

printf("请输入想要查找的数:");
scanf("%d", &i);
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] < i)
{
left++;
}
else if (arr[mid] > i)
{
right--;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)
{
printf("找不到\n");
}
return 0;
}

#include <stdio.h>            //【优化版】

int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
int i = 0;

printf("请输入想要查找的数:");
scanf("%d", &i);
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] < i)
{
left = mid + 1;
}
else if (arr[mid] > i)
{
right = mid - 1;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)
{
printf("找不到\n");
}
return 0;
}

2、 

【数组的打印】

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

int main()
{
char arr1[] = "Welcome to Bit!!!!!!";
char arr2[] = "####################";
int left = 0;
int right = strlen(arr1) - 1;

while (left <= right)
{
printf("%s\n", arr2);
arr2[left] = arr1[left];
arr2[right] = arr1[right];
left++;
right--;
Sleep(1000);
system("cls");
}
printf("%s\n", arr2);
return 0;
}

 3、

输入:
5 6
1 3 7 9 22
2 8 10 17 33 44

输出:
1 2 3 7 8 9 10 17 22 33 44

#include <stdio.h>

int main()
{
    int n = 0;
    int m = 0;
    int a = 0;
    int b = 0;
    int c = 0;
    int A[];      //这里VS上不支持变长数组
    int B[];
    int C[];

    scanf("%d%d", &n, &m);
    for (a = 0; a < n; a++)
    {
        scanf("%d", &A[a]);
    }
    for (b = 0; b < m; b++)
    {
        scanf("%d", &B[b]);
    }
    while (a < n && b < m)
    {
        if (A[a] < B[b])
        {
            C[c++] = A[a++];
        }
        else
        {
            C[c++] = B[b++];
        }
    }
    while (a < n)
    {
        C[c++] = A[a++];
    }
    while (b < m)
    {
        C[c++] = B[b++];
    }
    for (int i = 0; i < n + m; i++)
    {
        printf("%d ", C[i]);
    }
    return 0;
}

4、

【一行,逆序输出输入的10个整数,用空格分隔。】

#include <stdio.h>

int main()
{
    int i = 0;
    int arr[10];     
    for (i = 0; i < 10; i++)
    {
        scanf("%d", &arr[i]);
    }
    for (i = 9; i >= 0; i--)
    {
        printf("%d ", arr[i]);
    }
    return 0;
}

 

                                 点击跳转主页—> 💥个人主页小羊在奋斗


原文地址:https://blog.csdn.net/2301_78843337/article/details/137893434

免责声明:本站文章内容转载自网络资源,如本站内容侵犯了原著者的合法权益,可联系本站删除。更多内容请关注自学内容网(zxcms.com)!