#include<iostream>
using namespace std;
int sortarray(int *pa,int n);
int main(void)
{
int a[5];
int *pa=a;
cout<<"the five object in a array";
for(int i=0;i<5;i++)
{
cout<<i<<":";
cin>>*(pa+i);
}
sortarray(pa,5);
return 0;
}
int sortarray(int *pa,int n)
{ int k,transmission;
for(int i=0;i<(n-1);i++)
{
k=i;
for(int j=i+1;j<n;j++) //曾经错写 成 j=k+1 运行编译成功,但结果不对
{
if (*(pa+j) < *(pa+k))
{
k=j;
transmission= *(pa+k);
*(pa+k)=*(pa+i);
*(pa+i)=transmission;
}
}
}
for(int i=0;i<n;i++)
{
cout<<i<<":"<<*(pa+i)<<"\t";
}
}
#include <iostream>
#include<iomanip>
using namespace std;
typedef struct demo
{
string name;
int isbn;
float price;
string author;
}book;
int main(void)
{
book a[3]={{"balabala",001,20.3,"la"},
{"lawulawu",002,40.5,"wu"},
{"dhdhdh",003,4.3,"erha"}
};
for(int i=0;i<3;i++)
{
if(a[i].price<30)
cout<<"name:"<<left<<setw(15)<<a[i].name<<"isbn:"<<left<<setw(10)<<a[i].isbn<<"price:"<<left<<setw(10)<<a[i].price<<"author:"<<left<<setw(10)<<a[i].author<<endl;
}
return 0;
}
指针数组 结构数组 经典实现
最新推荐文章于 2024-01-02 20:26:00 发布