View Code of Problem 49

#include <iostream>
using namespace std;

void min(int *p, int n)
{
	int i, temp, min1;
	min1 = 0;
	for (i = 1; i < n; i++)
	{
		if (p[i] < p[min1])
			min1 = i;
	}
	temp = p[0];
	p[0] = p[min1];
	p[min1] = temp;
}
void max(int *p, int n)
{
	int i, temp, max1;
	max1 = 0;
	for (i = 1; i < n; i++)
	{
		if (p[i] > p[max1])
			max1 = i;
	}
	temp = p[n-1];
	p[n-1] = p[max1];
	p[max1] = temp;
}
int main()
{
	int n;
	int a[10];
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	min(a, n);
	max(a, n);
	for (int i = 0; i < n - 1; i++)
		cout << a[i] << " ";
	cout << a[n - 1] << endl;
	return 0;
}

Double click to view unformatted code.


Back to problem 49