0 like 0 dislike
9.1k views

 

void find_two_largest(int a[], int n, int *largest, int *second_largest);

* When passed an array a of length n, the function will search a for its largest and second-largest elements, storing them in the variables pointed to by largest and second_largest respectively.

Finish the code below to match the input and output. Pointer are required.

#include <stdio.h>

void find_two_largest(int a[], int n, int *largest, int *second_largest);

int main(void)
{
	int n, largest, second_largest;
	scanf("%d", &n); //Numbers will be entered
	int a[n];
    //Enter n integers separated by spaces
	for (int i = 0; i < n; i++)
		scanf(" %d", &a[i]);

	find_two_largest(a, n, &largest, &second_largest);

	if (n == 0)
		//No numbers were entered.
	else if (n == 1)
		//Only one number was entered. Largest: 
	else
		//Largest: , Second Largest:

	return 0;
}

void find_two_largest(int a[], int n, int *largest, int *second_largest)
{
	// Your code here (Using pointer to finish)
}

 

Example input:

0

Example output:

No numbers were entered.

 

Example input:

 

1
67

Example output:

 

Only one number was entered. Largest: 67

Example input:

5
5 6 7 8 9

Example output:

Largest: 9, Second Largest: 8

 

[Exercise] Coding (C) - asked in C
ID: 22313 - Available when: Unlimited - Due to: Unlimited
1 flag
edited by | 9.1k views
0 0
Called for Help

87 Answers

0 like 0 dislike
Hidden content!
#include ** * * * *



void ** **** * a[], int n, int *largest, int *** * *

{
*** * ** * ** ** i;
* * ** * * * * * * * *largest=a[0], *** *** *** * i<n; i++){
* *** * *** ** ** ** *** * ** * * * * * ** ******* *** * *** * * ******
* * * ** * * * * ***** * * ** * * ** ***** * * ** **** **** * ** *** **** ** * * ** *** *** **
*** ****** * * * * *
* * * ** ** ** * * * * * * * * i<n; i++){
* * *** *** *** *** *** ** ** * *** ** * *** ******* * * * * * * * * *** ** ** ** * * *
*** ** ** ** * * * * ***

}



int main(void)

{
** * ** **** * *** * n, largest, ** * *
* * * ** * * * ** ** ** *** ** &n); //Numbers will be entered
* * ** * ** ** * a[n], i;
* * ***** * * * *** ** * ** n integers separated by spaces
** ** * ** * ** * (i = 0; i < n; i++)
* *** * * * ***** * ** * * * * * ** *** ** * %d", * **


*** * ** ** * ****** * * n, * ** * * * * *


** **** ********* ** (n == 0) * ** ** * numbers were * ** *** ***
* *** * * **** **** * * * ** * * * numbers were entered.
*** ** * * * * if (n == 1) * ** * *** ** one number was entered. Largest: * * * * **
* * *** *** *** ** *** * * * * * ***** * ** * one number was entered. Largest:
* * * * * * ** **** * * *** ** ** *** %d, Second Largest: ** *** * *** ** *
* ** * *** ** * **** * *** * * * * * ***** * ** * , Second Largest:


* * ** ****** *** ** ** 0;

}
answered by (-368 points)
0 like 0 dislike
Hidden content!
#include ** * **



void find_two_largest(int a[], int n, int *largest, int *second_largest);



int main(void)

{
* ** * * ** **** * ** n, largest, second_largest;
* * * * ***** ** ******* **** * * * ** * &n);
* ** ** * ** ** ** * *** * a[n];
** ** ****** ** * **** (int i = 0; i < n; i++)
* ** * * * ** *** * ** * ** * ** * *** * %d", &a[i]);
* ** * ** ** ** * ** *** * * n, &largest, ** * ** *


** ** ****** ******** (n == 0)
* ** * * ******* * ** * *** ******* **** ** *** numbers were entered");
* ** ** *** * *** * if (n == 1)
** ****** * * ** * * ** * * * * * * ** * * ** * ******* one number was entered. Largest: %d",a[0]);
**** * * * *** * * * *
* ** * *** * * * *** * * * ** * * ** * *** * ****** *** %d, Second Largest: ** * ** ** ** * *


* * *** **** * ** ** 0;

}



void find_two_largest(int a[], int n, int *largest, int *second_largest)

{
* ** *** * *** **** * i,max1=0,max2=0;
**** **** *** * ***** * ** ** ** *** **
*** * * *** ** **
* ** ** * *** * *** ***** * ** * ** * **** ** **
*** * *** * * * * * * ***** ** ***** **** **
** * * * * ***** ** ** *** ** ***** ** * * * ***** ** * ****** **** * * **** * * * *
* * * * * ** ** **** ** * * *** ** * *
* ** **** * * ** ** *
**** ** * ** ** ** ** ** ** *
*** * * * * ** * *
*** ** *** * **** ** *** * * ** * ** * * ** && a[i]<max1)
* *** * ****** ** * ***** * * * ***** **********
* ***** * *** ***** ***** *** *** * ** * * *** * * * * * * * * * *
* *** * * * * ** ** ** * * * ** ** * ***
* ** * * **** * *** ** *
* * ** * *** * * **** ******* * ** ** **
** *** ** **** ** * * * ***** * * *** * * * *

}
answered by (-368 points)
0 like 0 dislike
Hidden content!
#include * * * ** *** **



void find_two_largest(int a[], int n, int *largest, int *second_largest);



int main(void)

{
*** * * *** *** * ** n, largest, second_largest;
** *** ** * ** * * * ***** * ***** * * &n); //Numbers will be entered
* * *** * * ** * *** * a[n],i;
** *** * *** * *** * * * n integers separated by spaces
* ** *** ** * *** ** * * (i = 0; i < n; i++)
*** ** * * ******** ** *** ** * *** ** * ** ****** ** ** * * ***** %d", &a[i]);


* ** ** * ** * * * * * * **** *** * n, &largest, **** * * ** *


*** **** ** * * *** * (n == 0)
* ** * * ** ** *** * * * ** *** * ***** numbers were entered.
* * ***** ******* ** *** * ***** ** * * ** * ** *** * ** numbers were * ** * * *
* ** * *** ********** **** if (n == 1)
* * **** ** * * ** * **** * * ** ** * * one number was entered. Largest:
* * ** ** *** * *** **** ** * *** *** * *** one number was entered. Largest: *** * ** **
* * * ** ****** * ** * *
* **** *** * *** ** * ** ** * * *** *** * **** , Second Largest:
* ********* * * * ** * * * *** ** * * ** * * ** * * * %d, Second largest: *** * ** ** *


* * *** ***** * ** ***** *** 0;

}



void ** * a[], int n, int *largest, int *second_largest)

{
** ******* ** * ** Your code here (Using pointer to finish)
* * **** ***** * **** i, b;
* * * * * ** ******* ***
** * * ** **** *** *** * * * * ***
***** ****** * * * *** * i<n; i++)
** *** ** ** ** * ***
* ** ** ** * * *** * * * ** * * ** * ** * *
*** * * *** ** * ** *** ******* * ***** ** **
** * * * * *** * *** * ** * * ***** * * * *** * * ** * * ** **** * * ***
* * * * **** *** **** * *** * * * ** * ** * *** * ** * * ** ** * ** = i;
* ** * * **** **** * * * ***** * *
*** ** * *** * *** *
* ******* * ** *** ** i<n; i++)
** *** ** ** * **
* ******** **** ** **** *** * ** ** * * ** *** * * * **** ** && i!=b)
** * *** ***** ** ** *** ** * ** ** ** *
* **** **** *** ** * * *** *** * * *** **** ** ** *** *** * * * * * * * * *** * *
* * *** ** * ** ** ** ** * * *** * * ***
* ** * * ** *** *

}
answered by (-368 points)
0 like 0 dislike
Hidden content!
#include *** ** * * * *



void ** ** ** * a[], int n, int *largest, int ****** **



int main(void)

{
* *** * ** * ** ** *** n, i, largest, second_largest;
*** ** * ***** * ** ** ** * * **** ** * ** * &n); //Numbers will be entered
** ** * ** * ** * * * a[n];
* ** ** ***** *** **** * * n integers separated by spaces
** * *** * ***** * * **** (i = 0; i < n; i++)
*** * * *** ** **** **** **** ** * * * * ** %d", * ** * *


** * * *** * ***** ******* * * n, * **** ** * * *


* *** * **** **** * (n == 0)
****** * * ** **** * ** * * **** * ** * * numbers were * ** *** *
****** * * * * ** ***** if (n == 1)
** *** ** * * * *** * * *** ** * ** ** * * * *** *** one number was entered. Largest: %d", largest);
** ** **** * ***** *** *
** ** **** **** * ** * *** * ** ** * * * ** **** **** %d, Second Largest: %d", largest, *


****** * *** *** ** * * 0;

}



void ** ***** * * a[], int n, int *largest, int * **

{
*** ** *** * * * * * * i, j = 0;
* * * ** * * *** **** *** = a[0];
** ** ** * **** * * ** = 0; i < n; i++)
** * ** * * ** * *** **
* ** * **** ** ****** * ********** * * * * * * *** < a[i])
* * * *** **** * ******** *
* ** * * * * *** **** ** * ** * *** * ***** * ** ** ******* ***** ** ** ** = a[i];
*** ******* *** * * * * ** * ** *** **** *** * * * ** = i;
***** ** *** ** ** * * *** ** * ** *** ***
* **** ** ** * * ** * * *


** * *** * * * ** * *** ***** = a[0];
** * ************* ** * * = 0; i < n; i++)
**** *** ** *** *
* *** ** * * * * * ** *** * ** * * ** > *second_largest * * ** ** i != j)
* * * ** * **** * ** *
** * * *** * * *** *** * ** ** * ** * * * * * * ** * ** * * * ****** * ** = a[i];
* * *** * * * * ***** ** * * * * * * *
** *** * * *** ** ** * *

}
answered by (-218 points)
0 like 0 dislike
Hidden content!
#include * *** *** **** *



void * * *** * ** a[], int n, int *largest, int **** **



int main(void)

{
* * * * *** * **** n, i, largest, second_largest;
* **** * ** ** * ** * *** * ***** &n); //Numbers will be entered
* * ******** * ******* * ** a[n];
* * ** ** * ***** * *** *** n integers separated by spaces
* *** * ************** * * (i = 0; i < n; i++)
* * ** ** * **** * **** * * ** ** * *** ****** * %d", **** ** *


* ** * ** *** * * * * **** ** n, ** * *** ** ** * ** *


* * *** *** *** ** (n == 0)
* * * ** * * * **** ** *** ** * ** * numbers were * ** * *
* ** ********** ** *** if (n == 1)
* *** * ** * **** ***** * ** * * ** ** * * *** one number was entered. Largest: %d", largest);
* * * * *** * ***** * **
* ***** ***** *** ** **** * * *** **** ** *** * * * * ** * * %d, Second Largest: %d", largest, ***** ** **


*** *** * ****** ** * ** * 0;

}



void ******* a[], int n, int *largest, int * * *

{
* ** * * **** ** ** * i, j = 0;
* ** * ****** * = a[0];
* * ** *** *** * ** * ****** = 0; i < n; i++)
* ** *** ** *** ** * *
*** * * * ******* ** ** *** * * **** * ** < a[i])
* * * * *** ** *** ** ** ** ** * * * *
* * * * *** * ** **** ** ** *** ***** ** ** = a[i];
* ***** * * * **** ** * ** ** ** * ***** ** **** *** ***** * * * ** = i;
** *** ** *** *** ***** *** **** ** **** *
* * ** ** * **** * * *** ***


* ** * * **** **** *** * * **** = a[0];
** * *** ** ** ** * * *** = 0; i < n; i++)
* ** * *** * **
* *** *** **** ** ** * * * * ** * *** * ** > *second_largest **** * * i != j)
* *** **** ** ** ** ** *** * * * * ** ** * **
*** * ** *** ****** * **** **** * ** * ** ** *** *** * * ** ** * = a[i];
* * * * * **** *** ****** ** * * ** **** * ***
* * ** * **** * * * ** **

}
answered by (20 points)
0 like 0 dislike
Hidden content!
#include ** ** *



void find_two_largest(int a[], int n, int *largest, int *second_largest);



int main(void)

{
*** ** * * *** * ** ** * i, n, largest, second_largest;
** ** *** ** * ** ** *** ** * **** * * *** &n); //Numbers will be entered
* * ** ** **** ** * ** a[n];
* * ** * * * * * ** * ** * * * * n integers separated by spaces
**** * ** ** * ****** * (i = 0; i < n; i++)
* * * * ** * * ** * * * ***** ** ** *** * * %d", &a[i]);


** **** * * * *** *** * * ** * ** ** * n, &largest, *** * ** ***


**** ** **** * * * ** (n == 0)
** ***** * ** * ** * ** ** *** ** ** ** * ** numbers were entered.
** ** * * * ** *** * ** **** * * * * * ***** *** numbers were ** *** * **


***** ** *** * ** * * * * *** ** ** ** ** * *** * if (n == 1)
* **** * * * * * * **** * **** ** ***** * * *** ** * ** * * **** * ***** one number was entered. Largest:
* **** * * * * * * * ** *** * *** ** ** * ** ** ** * * ** ** ******** * * * * one number was entered. Largest: %d", a[0]);


* * * * * ******** ****** ** ** **** *** ** ****** *** ***** *
* *** *** * ** * *** ** ** ***** * ********* ** ** **** * * * * **** * ***** ** * *** * , Second Largest:
** *** * *** *** * ** * * * ** ** * ** * ** ** ** * * *** * **** * * * %d, Second Largest: %d", largest, second_largest);


** * *** ** * * ** * * * ** * ***** ** * * * * * ** * * ** * ** ** ** * ********** *** * * ** 0;

}



void ** * * ** a[], int n, int *largest, int *second_largest)

{
* * * * ** * * * * ** Your code here (Using pointer to finish)
* ** **** * ** * *** ** i, j, k;
** * ** **** * ** temp = 0;


* * ****** * **** ** * * = 0; k< n; k++)
** ****** *** * ** * ** * * ** * ** * * ** * ** * ***** ** ** * *** * * * ** *** a[k]);
* ***** * *** * * ******** ** ** * * *****




* * ** * ** **** **** ** = 0; i < n-1; i++){
* **** ** * ** * *** ***** * * * ** * * * ** = 0; j < n-i-1; j++){
** ** **** ** ** **** **** *** *** * ******* ** *** * * ** * * ** ** * > a[j+1]){
* *** ** ** * * * ** * *** ** ** *** * * ** ** **** **** * ** ** ** ***** %d %d %d\n",j, a[j], a[j+1]);
** * * ** *** * * * ******* * * * *** * ** *** ** ***** *** * *** * * ****** * = a[j];
******** * * ** *** ** * **** ** ** * **** * * ******* *** ** *** ** ** ** * ** * * ** = a[j+1];
****** **** * * ** * * * * * * * * * ** * * **** * * ** ** * * * ** * * *** * * = temp;
** * * ** **** * * ** * * ** ** * * *** ** **** **** * * ** **
***** * *** * * ** *** * *** ** ** * ** ***


* * ** ** * * ** * * * * *** * * *** * * * = 0; k< n; k++)
*** ** **** * * * ** * **** * * * * ** * * * **** ** *** * * * * * ", a[k]);
* * * * * * ** * * ** ** * *** *** ** * ***** * *
** * **


**** * * * * * ** * *** ** i < n; i++)
* ** * ** ** * *** * ** ** * * * *** * ** ***** ", a[i]);*/


* ** ** *** *** * *** ** *** * * ** * * a[n-1]);


* * ******* * * * ***** * * = a[n-1];
** ** ** * ***** ***** ****** = a[n-2];

}
answered by (-188 points)
0 like 0 dislike
Hidden content!
#include * * *** ****



void ******* a[], int n, int *largest, int *** * ** **



int main(void)

{
* * * **** *** ** *** ** ** * i, n, largest, second_largest;
* * * * * ** *** * *** * * ** * ** &n); //Numbers will be entered
* * *** * * * **** * * a[n];
* * * * *** * * * * **** n integers separated by spaces
** ** * *** * **** * * * * (i = 0; i < n; i++)
* ** * ** *** ** * * *** ** * ** ** * * ** * * **** * %d", &a[i]);


* ********* *** * * * * * *** ** * n, * *** ** ** ** ** *


* *** **** ** *** *** * (n == 0)
* ***** ** * *** * ******* ** * ** ** numbers were entered.
** * * *** * * **** * * * ****** * **** * ** * ** * numbers were * ** *** *
* * *** * ** * * * **** ** *** * ** * * * * *** if (n == 1)
* *** * * ** * **** ** ***** * * ** * * ** * **** ** * ** one number was entered. Largest:
* ** * **** ** * ** * * ** * ***** * * ** ** * * * *** ***** * * ** * one number was entered. Largest: %d", a[0]);
**** * **** ****** * ** ***** ****** **** * * *** * ** * * * **** * **** **
*** *** ** * ** **** ****** ** *** * * *** * * *** * * * ** ** ***** ** ** ** ** , Second Largest:
***** *** * ** * * * ** * ** ** * ** * ****** ** * ** * * * **** ** ** * *** *** ***** ***** ******* %d, Second Largest: %d", largest, second_largest);


* * * * ** ** * ******* **** ***** * * * *** * *** ** ** *** * ** **** **** * *** ** 0;

}



void **** *** ** a[], int n, int *largest, int *second_largest)

{
* ***** ** * * ** ** * * Your code here (Using pointer to finish)
** ** * * ** ** * **** i, j;
* * *** ** *** *** ** temp = 0;
* *** * **** *** *** * ** = 0; i < n; i++){
** ** ****** * * *** *** * * *** * *** *** = 0; j < n-i; j++){
** *** *** ** ***** * ** ** * * * ** * ** * ********* * * *** ****** ** > a[j+1]){
** * * * * * **** ** * * * * * ** * * ** ***** *** ** **** * ** ** * * ** * = a[j];
* ** * *** *** ** *** * * * ** * *** ** *** * ****** ****** *** **** ** * * ** * ***** * **** = a[j+1];
* * * * * *** ** * ** * ** ******* ** **** ***** * * * * *** ** * * ** * ***** ** * = temp;
* ****** ** * ** ** ** * *** * *** * *** ** * ** * **** ***** *
*** *** ******** * ** *** ******* **** *
*** ** * * * *** ** * *


* ***** ** ** * * * * ** * * i<n; i++)
* * * ***** ** * * * * ** * ** * * * ** ** ** ** ** ", a[i]);


* * ** ** ** ** = a[n-1];
* *** * ** * * * *** * = a[n-2];

}
answered by (-188 points)
0 like 0 dislike
Hidden content!
#include * * ** *



void *** * *** * a[], int n, int *largest, int *second_largest);



int main(void)

{
*** * * ** **** * ** ** *** n, largest, second_largest;
**** ***** * * * ***** * * * * *** * &n); //Numbers will be entered
*** * * **** * * *** ** a[n];
*** *** * * * * ** *** n integers separated by spaces
*** * *** ** ** *** * *** (int i = 0; i < n; i++)
** * *** * ***** *** *** *** *** *** *** * * ** * ** * %d", &a[i]);
* * ** ** * *** ****
*** ** * ** *** * n, &largest, * ** ** ** * *
* * ** ** ***
** *** **** * * * (n == 0)
*** * ** ** * ** *** * **** **** numbers were entered.
** * * ** * * *** * ******* * ** **** * * * numbers were * * * * * *
** * * **** * ***** * ***** *** ** ** ****** * * if (n == 1)
******* * ** **** * *** * **** ** ** ***** * ***** * *** ** ** ***** one number was entered. Largest:
* *** * *** *** * ** ** ** * *** ** ** * ***** ** * * * * * ** one number was entered. Largest: %d", a[0]);
* * ** * *** * ** ** **** * **** ** * * * ** *** *****
** * ** * *** * **** ** * * * ***** *** ** * *** ** ** **** **** ** ***** ** ** * **** * * , Second Largest:
** *** *** **** *** **** * *** * * ***** * * ** * *** * * * * ** *** * * ** * *** * * *** %d, Second Largest: %d", largest, second_largest);
** **** * * *** ** ** * *** * * * ** * *** * * *** ** ** * ** * ** * * ** 0;

}



void * * *** a[], int n, int *largest, int *second_largest)

{
* * * ** * * ***** ***** * * Your code here (Using pointer to finish)
** * * * * * * * * i, j;
**** ** * ** ** ** * temp = 0;
* * * * * * * ** ** = 0; i < n; i++){
* *** ** * * ** * * * ** ** * ***** * ***** ** *** = 0; j > n-1; j++){
*** * *** ******* **** * * *** **** * * * ******** ** * * * ** > a[j+1]){
* * *** ** * ** * *** *** * * * ** **** *** ** *** * * ** ** * ****** ** * * * * = a[j];
*** ** * ***** * ** ***** ** *** ** * * ** ** *** * * ** *** ** * * * ** * * = a[j+1];
** ** * **** * ** **** *** * * * * ******* ***** ***** *** * * * *** ** * ** * *** ** * ** * * ***** * = temp;
** ** ** * * * * * * ** * * *** * * *** * *
******* * **** * ** * * *** * ******* * * *
** * ** ** **** * * *
* *** ** * *** ** *
** ** * * * * * ** * = a[n-1];
** * *** ** ** * *** * ** = a[n-2];

}
answered by (-188 points)
0 like 0 dislike
Hidden content!
#include ** ***** * *



void ***** * a[], int n, int *largest, int *second_largest);



int main(void)

{
** **** * * ** * **** n, largest, second_largest;
** * ** ** * ***** * ** ** *** &n); //Numbers will be entered
****** * * ** * *** a[n];
*** *** **** * ** * * n integers separated by spaces
* **** * * **** * * (int i = 0; i < n; i++)
* ** * *** * ** *** ** * * ****** ***** * *** * *** * ** ** %d", &a[i]);
*** * *** * *** *** *
** **** * * *** * * * * ***** n, &largest, ***** * **
*** * * *** *** * **
* * * ** * ** * * (n == 0)
* *** *** ******* *** **** ** * * * ** **** numbers were entered.
* ** * *** * **** **** * ** * *** * * ** * *** **** * numbers were ** ** * **
** ** ***** ** * *** * *** *** ** * * ***** ** if (n == 1)
**** * ******** * * * ******* *** * *** * * *** * ** *** * **** * *** * ** one number was entered. Largest:
****** * * ** * * * * *** * ** * ** ***** * * ** *** ** * ** * ** * one number was entered. Largest: %d", largest);
* ****** * * * * ** ** *** **** * ****** ** ***** ******* * ****** ** ****
* * ** * **** * * ****** ** * ** ** *** * ** * * ***** * ** * **** * ** ** ** ** * ** , Second Largest:
*** * * **** * ** * * *** *** ** ** * * * *** ** * * *** **** * * **** * * * ** * ** * *** %d, Second Largest: %d", largest, second_largest);
* * * *** * * *** * * * * *** * * * * * *** * ** ** * * ** *** *** * *** * * * * ** 0;

}



void * ******* * a[], int n, int *largest, int *second_largest)

{
** ** ****** ****** * ** ** Your code here (Using pointer to finish)
* * * *** *** ** * * * * * * i, j;
* * ** ** * temp = 0;
** *** * * ** * = 0; i < n; i++){
* *** * ** *** * *** ** **** ** * *** = 0; j > n-1; j++){
* ** * *** ** *** * * * *** * * * * * ** ** ** * * * ** **** ** > a[j+1]){
* ******* ** * ** * ** * * * ** * ******* ** * ** ** *** * ** **** ** ** * ** **** = a[j];
*** * * *** * * **** ** * * * * * * * *** * ** * * * * **** ** * * ***** ** * ** ** ** * * = a[j+1];
* ** ** ** *** *** * * **** ** ** ** **** ** * ***** * ** * ** * ** * * * *** * * ** * * * = temp;
* * ******* *** * * *** * * ***** *** ** * * ** * ** * * **
* * * ** ** * * * * **** * * * *** * ** ***
* ** ** ** * * ** *** * *
* * * * ** * * *
*** * * ***** * ***** * * **** = a[n-1];
* * *** * ** * **** * = a[n-2];

}
answered by (-188 points)
0 like 0 dislike
Hidden content!
#include ** ** * **



void ** * * * a[], int n, int *largest, int *** ** *



int main(void)

{
****** ** * * ** n, i, largest, second_largest;
** * * **** ** ** * ** * ** ******* &n); //Numbers will be entered
* *** ****** **** a[n];
*** * *** * *** ** * *** n integers separated by spaces
** ** * *** * * * ** (i = 0; i < n; i++)
***** * * * ** *** * *** * ** ****** **** * * %d", * ******


** * * * **** * * * **** **** ** n, ***** ** * * * * ** * ** **


* *** * * * ** * ** (n == 0)
* * ** * * * * * * *** ***** **** *** ** * * ** ** * numbers were * ** ***** ***
* * * * **** **** ***** * if (n == 1)
* * ** * ** **** ** ** * ** * *** *** * * * one number was entered. Largest: %d", largest);
***** *** * * ** ** **
***** * * ** * *** ** * * * *** * ****** * *** *** * %d, Second Largest: %d", largest, **


*** ** * ** **** * * *** 0;

}



void *** * *** * a[], int n, int *largest, int

{
** ****** * * * *** * i, j = 0;
* **** *** * * * = a[0];
* * * * ** ******** * = 0; i < n; i++)
**** * ******** ** *** *
* ** * * * * ** * * ** *** * *** * * * ** * * < a[i])
* ** *** * * ** * * * * ** *** **** * * * *
*** ** * * *** ** * * * **** ** ** ** ** * * ** * ** * * * ******* *** * * = a[i];
* * ****** * ** * * * * * ** * * *** ***** * *** **** * * = i;
* ** * * * * * * ** * ** ** ****** *** * *
*** * *** ** * * * ***


* * * **** ** ** ** ** = a[0];
*** ** ****** ** * * * ** * = 0; i < n; i++)
*** * * ** * ** * ***
*** * * ** ***** * **** ** ***** ** * *** * * > *second_largest * **** * *** * i != j)
** * ** * ** * ** * ** ** * **** * *
* ***** ** * ******* * * * *** *** * **** * * *** * * * * *** ** * * * = a[i];
***** ** **** * *** **** * * *** * ***
* * *** ** * * * * *

}
answered by (6 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.34.106
©2016-2025

Related questions

1 like 0 dislike
58 answers
[Exercise] Coding (C) - asked Mar 23, 2017 in C
ID: 23261 - Available when: Unlimited - Due to: Unlimited
| 6.7k views
0 like 0 dislike
1 answer
[Exercise] Coding (C) - asked Apr 27, 2017 in C++
ID: 24390 - Available when: Unlimited - Due to: Unlimited
| 970 views
12,783 questions
183,442 answers
172,219 comments
4,824 users