1 solutions

  • 0
    @ 2025-11-5 19:06:05

    C++ :

    #include<iostream>
    using namespace std;
    void input(int *p,int n)
    {
    	for (int i=0; i<n; i++) cin>>p[i];
    }
    void deal(int *p,int n)
    {
    	int *max,*min,*q,t;
    	max=min=p;
    	for (q=p+1; q<p+n; q++)	//查找最小值
    		if (*min>*q) min=q;
    	t=p[0]; p[0]=*min; *min=t;
    	for (q=p+1; q<p+n; q++)	//查找最大值
    		if (*max<*q) max=q;
    	t=p[n-1]; p[n-1]=*max; *max=t;
    }
    void output(int *p,int n)
    {
    	int *q;
    	for (q=p; q<p+n; q++) cout<<*q<<" ";
    	cout<<endl;
    }
    int main()
    {
    	int a[10];
    	input(a,10);
    	deal(a,10);
    	output(a,10);
    	return 0;
    }
    
    • 1

    C语言程序设计教程(第三版)课后习题10.3

    Information

    ID
    19171
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By