查找数组中最大的2个数

#include <stdio.h>

void find_2_largest(int array[], int array_length, int *plargest, int *psecond_largest);

int main(void){
int array[10]={23,45,987,3,-90,123,987,1975,988,0};
int largest=0;
int second_largest=0;
int array_length=sizeof(array)/sizeof(array[0]);

find_2_largest(array, array_length, &largest, &second_largest);

printf("The 2 largest number is: %d and %d.\n", largest, second_largest);
return 0;
}

void find_2_largest(int array[], int array_length, int *plargest, int *psecond_largest){

if(array[0]>array[1]){
*plargest=array[0];
*psecond_largest=array[1];
}else{
*plargest=array[1];
*psecond_largest=array[0];
}

for(int i=2; i<array_length; i++){
if(array[i]>*plargest){
*psecond_largest=*plargest;
*plargest=array[i];
}else if(array[i]>*psecond_largest){
*psecond_largest=array[i];
}

}
}