1.思维导图![](https://i-blog.csdnimg.cn/blog_migrate/96a2b7fc32a95ebb83570c15062cdcfd.png)
练习1:输入两个字符串,自定义函数实现实现拷贝
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void my_strcpy(char *dest,char *src);
int main(int argc, const char *argv[])
{
char dest[20]="hello";
char src[]="world";
my_strcpy(dest,src);
puts(dest);
puts(src);
return 0;
}
void my_strcpy(char *dest,char *src)
{
int i = 0;
while(*(src+i)!='\0'){
*(dest+i)=*(src+i);
i++;
}
*(src+i)='\0';
}
练习2:输入数组,实现简单选择降序
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void simsort(int *arr,int len);
int main(int argc, const char *argv[])
{
int n = 0;
printf("please input n");
scanf("%d",&n);
int arr[n];
int i = 0;
for(i=0;i<n;i++){
printf("please input num");
scanf("%d",arr+i);
}
simsort(arr,n);
for(i=0;i<n;i++){
printf("%d ",arr[i]);
}
putchar(10);
return 0;
}
void simsort(int *arr,int len)
{
int i = 0;
int j = 0;
int min = 0;
for(i=0;i<len-1;i++){
min = i;
for(j=i+1;j<len;j++){
if(*(arr+min) < *(arr+j))
min = j;
}
if(min!=i){
*(arr+min) ^= *(arr+i);
*(arr+i) ^= *(arr+min);
*(arr+min) ^= *(arr+i);
}
}
}
练习3:输入数组元素,使用有参无返函数实现最大值和最小值交换
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void exchange(int *arr,int len);
int main(int argc, const char *argv[])
{
int n = 0;
printf("please input n");
scanf("%d",&n);
int arr[n];
int i = 0;
for(i=0;i<n;i++){
printf("please input num");
scanf("%d",arr+i);
}
exchange(arr,n);
for(i=0;i<n;i++){
printf("%d ",arr[i]);
}
putchar(10);
return 0;
}
void exchange(int *arr,int len)
{
int max = 0;
int min = 0;
int i = 0;
for(i=0;i<len;i++){
if(*(arr+min)>*(arr+i))
min = i;
if(*(arr+max)<*(arr+i))
max = i;
}
*(arr+max) ^= *(arr+min);
*(arr+min) ^= *(arr+max);
*(arr+max) ^= *(arr+min);
}
练习4:通过指针实现字符串逆置
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void negseq(char *arr,int len);
int main(int argc, const char *argv[])
{
char str[100];
gets(str);
negseq(str,strlen(str));
puts(str);
return 0;
}
void negseq(char *arr,int len)
{
int start = 0;
int end = len-1;
while(start<end){
*(arr+start) ^= *(arr+end);
*(arr+end) ^= *(arr+start);
*(arr+start) ^= *(arr+end);
start++;
end--;
}
}
练习5:输入n个元素,定义有参无返函数实现冒泡排序
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void Bullue(int *arr,int len);
int main(int argc, const char *argv[])
{
int n = 0;
printf("please input n");
scanf("%d",&n);
int arr[n];
int i = 0;
for(i=0;i<n;i++){
printf("please input num");
scanf("%d",arr+i);
}
Bullue(arr,n);
for(i=0;i<n;i++){
printf("%d ",arr[i]);
}
putchar(10);
return 0;
}
void Bullue(int *arr,int len)
{
int i = 0;
int j = 0;
for(i=0;i<len-1;i++){
for(j=0;j<len-i-1;j++){
if(*(arr+j)>*(arr+j+1)){
*(arr+j) ^= *(arr+j+1);
*(arr+j+1) ^= *(arr+j);
*(arr+j) ^= *(arr+j+1);
}
}
}
}