0719学习笔记（地址和数组类型占用空间大小以及数组排序）

地址和数组类型占用空间大小

#include <stdio.h>

int main()
{
	printf("cahr 大小%d字节\n",sizeof(char));
	printf("int 大小%d字节\n",sizeof(int));
	printf("long long int 大小%d字节\n",sizeof(long long int));
	char ch[4]={'1'};
	printf("char ch[0]地址%#p\n",&ch[0]);
	printf("char ch[1]地址%#p\n",&ch[1]);
	printf("char ch[2]地址%#p\n",&ch[2]);
	printf("char ch[3]地址%#p\n",&ch[3]);
	int a[4]={0};
	printf("int a[0]地址%#p\n",&a[0]);
	printf("int a[1]地址%#p\n",&a[1]);
	printf("int a[2]地址%#p\n",&a[2]);
	printf("int a[3]地址%#p\n",&a[3]);
	long long int b[4]={0};
	printf("long long int b[0]地址%#p\n",&b[0]);
	printf("long long int b[1]地址%#p\n",&b[1]);
	printf("long long int b[2]地址%#p\n",&b[2]);
	printf("long long int b[3]地址%#p\n",&b[3]);
	return 0;
}

结果

cahr 大小1字节
int 大小4字节
long long int 大小8字节
char ch[0]地址0X000000000062FE10
char ch[1]地址0X000000000062FE11
char ch[2]地址0X000000000062FE12
char ch[3]地址0X000000000062FE13
int a[0]地址0X000000000062FE00
int a[1]地址0X000000000062FE04
int a[2]地址0X000000000062FE08
int a[3]地址0X000000000062FE0C
long long int b[0]地址0X000000000062FDE0
long long int b[1]地址0X000000000062FDE8
long long int b[2]地址0X000000000062FDF0
long long int b[3]地址0X000000000062FDF8

char	ch[0]	0X000000000062FE10
	ch[1]	0X000000000062FE11
	ch[2]	0X000000000062FE12
	ch[3]	0X000000000062FE13

int	a[0]	0X000000000062FE00
		0X000000000062FE01
		0X000000000062FE02
		0X000000000062FE03
	a[1]	0X000000000062FE04
		0X000000000062FE05
		0X000000000062FE06
		0X000000000062FE07
	a[2]	0X000000000062FE08
		...
	a[3]	0X000000000062FE0C
		...

long long int	b[0]	0X000000000062FDE0
		0X000000000062FDE1
		0X000000000062FDE2
		0X000000000062FDE3
		0X000000000062FDE4
		0X000000000062FDE5
		0X000000000062FDE6
		0X000000000062FDE7
	b[1]	0X000000000062FDE8
		0X000000000062FDE9
		0X000000000062FDEA
		0X000000000062FDEB
		0X000000000062FDEC
		0X000000000062FDED
		0X000000000062FDEE
		0X000000000062FDEF
	b[2]	0X000000000062FDF0
		...
	b[3]	0X000000000062FDF8
		...

逆序

#include <stdio.h>
void inr(int a[],int n);

int main()
{
	int arr[5]={10,11,12,13,14};
	int n;
	for(n=0;n<5;n++)
	{
		printf("arr[%d]=%d\n",n,arr[n]);
	}
	inr(arr,5);
	for(n=0;n<5;n++)
	{
		printf("arr[%d]=%d\n",n,arr[n]);
	}
	return 0;
}

void inr(int a[],int n)
{
	int i,tp;
	for(i=0;i<n/2;i++)
	{
		tp=a[i];
		a[i]=a[n-i-1];
		a[n-i-1]=tp;
	}
}

排序

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void px(int a[],int b);

int main()
{
	int i;
	srand((unsigned)time(NULL));
	int num[5]={0};
//	printf("请输入数值：\n");
	for(i=0;i<5;i++)
	{
		num[i]=rand();
	}
	for(i=0;i<5;i++)
	{
		printf("变更前num[%d]=%d\n",i,num[i]);
	}
	printf("\n\n\n\n");
	px(num,5); 
	for(i=0;i<5;i++)
	{
		printf("变更后num[%d]=%d\n",i,num[i]);
	}
	return 0;
}

void px(int a[],int b)
{
	int i,y,n,c;
	c=b;
	for(y=0;y<b-1;y++)
	{
		for(i=0;i<c;i++)
		{
			if(a[i]<a[i+1])
			{
				n=a[i];
				a[i]=a[i+1];
				a[i+1]=n;
			}
		}
		c--;
	}
}