#include<bits/stdc++.h>
using namespace std;
#define Max 50
struct SqList{
int a[Max]={1,2,3,4,5};
int length=5;
};
bool listdelete(SqList &s,int &ele)
{
if (s.length == 0) {
return false;
}
int min = s.a[0];
int flag = 0;
for (int i = 0; i < s.length; i++)
{
if (s.a[i] < min) {
min = s.a[i];
flag = i;
}
}
ele = s.a[flag];
s.a[flag] = s.a[s.length - 1];
int len = sizeof(s.a) / sizeof(s.a[0]);
cout << len << endl;
return true;
}
int main()
{
SqList s;
cout << "原先数组为:" << endl;
for (int i = 0; i < s.length; i++) cout << s.a[i] << " ";
cout << endl;
int k = 0;
if (listdelete(s, k))
{
cout << "最小元素k=" << k << endl;
cout << "修改之后的线性表为:" << endl;
for (int i = 0; i < s.length; i++)
{
cout << s.a[i] << " ";
}
cout << endl;
}
else {
cout << "错误" << endl;
}
return 0;
}