题解 | #小乐乐找最大数#

#include <iostream>
#include <malloc.h>

using namespace std;

int * maopao(int *);
void centre(void);

int main(void)
{
	centre();
	
	return 0;
}

int * maopao(int * data, int len)
{
	int t;
	int i;
	int temp;
	for(t = len - 1;t >= 0;--t){
		for(i = 0;i < t;++i){
			if(data[i] > data[i+1]){
				temp = data[i];
				data[i] = data[i+1];
				data[i+1] = temp;
			}
		}
	}
	return data;
}

void centre(void)
{
	int * val = (int *)malloc(4 * sizeof(int));
	int * maopaojieguo = (int *)malloc(4 * sizeof(int));
	int i;
	cin>>val[0]>>val[1]>>val[2]>>val[3];
	maopaojieguo = maopao(val, 4);
	cout<<maopaojieguo[3];
}

冒泡