1、一维数组定义:
#include<iostream>
using namespace std;
int main()
{
int score[10];
score[0]=10;
score[1]=20;
for(int i =0;i<10;i++)
{
cout<<score[i]<<endl;
}
int score1[10]={10,20,30,20,50,60,70,80};
for (int i=0;i<10;i++)
{
cout<<score1[i]<<endl;
}
int score2[]={10,20,30,40,50,60,70,80};
cout<<"dsd:"<<endl;
for (int i=0;i<sizeof(score2)/sizeof(score2[0]);i++)
{
cout<<score2[i]<<endl;
}
int num[10]={234,1,34,67,99,3332,45,100,34,2};
int max=0;
for(int i=0;i<sizeof(num)/sizeof(num[0]);i++)
{
if (max>num[i])
{
continue;
}
else
{
max=num[i];
}
}
cout<<"max is:"<<max<<endl;
int arr[]={10,20,30,40,50};
int temp=0;
int star=0;
int end=sizeof(arr)/sizeof(arr[0])-1;
while(star<end)
{
temp=arr[star];
arr[star]=arr[end];
arr[end]=temp;
star++;
end--;
}
for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
{
cout<<arr[i]<<endl;
}
return 0;
}
2、冒泡排序:
#include<iostream>
using namespace std;
int main()
{
int arr[]={3,5,6,4,2,1,0,8,7,9,10};
cout<<"排序前:"<<endl;
for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
{
cout<<arr[i]<<" ";
}
cout<<endl;
int temp;
for(int i=0;i<sizeof(arr)/sizeof(arr[0])-1;i++)
{
for(int j=0;j<sizeof(arr)/sizeof(arr[0])-1-i;j++)
{
if (arr[j]>arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
cout<<"排序后:"<<endl;
for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++)
{
cout<<arr[i]<<" ";
}
cout<<endl;
}
3、二维数组定义:
#include<iostream>
using namespace std;
int main()
{
int arr[2][3]=
{
{1,2,3},
{4,5,6}
};
for(int i =0;i<2;i++)
{
for(int j=0;j<3;j++)
{
cout<<arr[i][j]<<" ";
}
cout<<endl;
}
cout<<"二维数组占用的总空间:"<<sizeof(arr)<<endl;
cout<<"二维数组一行占用的总空间:"<<sizeof(arr[0])<<endl;
cout<<"二维数组一个元素占用的总空间:"<<sizeof(arr[0][0])<<endl;
cout<<"二维数组行数:"<<sizeof(arr)/sizeof(arr[0])<<endl;
cout<<"二维数组列数:"<<sizeof(arr[0])/sizeof(arr[0][0])<<endl;
}