0 like 0 dislike
11.3k 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 | 11.3k views
0 0
Called for Help

87 Answers

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 (-298 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 (126 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 (237 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 (-215 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 (38 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;
**** ** **** ** *** * = 0; i < n; i++)
* ** * * * * * * **
* * * * ***** * * * *** **** * * ** * *** *** = a[0];
* **** *** * ****** ** *** * * * * *** * * * * ** < a[i])
** * * * ** *** ** ** ** * *
** * * ** *** ** ** ** * * * * ** * * * ** ****** *** *** * * = a[i];
* *** * * *** ** * * * * * * *** * ** * *** *** ** * = i;
** * * * * *** * * ** ** *****
* * * ** ** * ****


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

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

#include ****** **** *



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



int main(void)

{
* *** **** * ** * **** n, i, 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;
* * *** * * *** *** * *** = 0; i < n; i++)
* ** * ** *** *** *****
** *** * *** ** * *** * * ** * *** * ** = a[0];
* **** * ** * * * * ****** ** * ** < a[i])
* **** ******* * ** ** * ** * ** * * *** **
*** * * * * * * * *** ** ** *** * ** ***** * * * ***** * ** * ** ** = a[i];
**** * * ** ***** * *** * * * ** ** *
** * **** *** ****


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

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

#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;
** * * * * * * *** * * ** = 0; i < n; i++)
** ** * * ** ** ** * **
** * ** ** ** * ** * * ** *** * * *********** * = a[0];
* * * * **** ** ** *** * ** **** ***** ** * ** * < a[i])
** *** *** ** * * * **** ** * ** ** *** * *
* * **** ** * ** ** *** ********* **** ** * * * ** * * **** ** ** = a[i];
* * ** ** *** ** * * ** * * **** ** ***** *** * **** * = i;
* * * * * * ** *** ***** **** * * *
* *** * ***** ** * * ** * *


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

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

#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 entered.");
** *** * * * ***** ** * ** * ** * ** * 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 find_two_largest(int a[], int n, int *largest, int *second_largest)

{
* **** * * * **** ***** ** Your code here (Using pointer to finish)
*** * ** * * ** ** * * i, j;
* *** *** * * * * temp;
** * ** * * *** * * i< n; i++){
* ** *** *** ** *** * ***** * * * * * ***** ** j< n-i; 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)

{
* * * *** ** * ** * *** 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 * * *** ** ***
****** **** * * * *
* * *** * *** * * *** if (n == 1)
** **** * ** * * **** ** *
*** * * **** * ** *** *** *** ** * **** ** * * * ** * one number was entered. Largest: %d", largest);
* ** *** * **** * * **
* * * **** * * ** * * **
** * * *** ** * * ** * *** ** ** * ***** * * %d, Second Largest: %d", largest, second_largest);


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

}



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

{
* * * * *** *** i,l=0,s=0;
**** ******* ***** * *** * = 0; i < n; i++)
******* ** **** * * *
******* *** * ** * ** * ***** * ** * ** * * ** > l)
* ** ***** * * * * **** *** * * * * * *
* ** * * *** * **** ** * ** ** * ** ** ** ****** * ** * **** ** = a[i];
* * * * * *** ***** * * ** * ** **


* * * * * ** ********** *
* ** ** **** ** * ** = 0; i < n; i++)
*** ** ** * ** * * ***
***** * * ** ** ****** **** * ** * ** ***** < l)
** **** * * ** ** * * ******* *** **
**** ** * * * * ****** ** ** *** **** * ** * ** ** * *** > s)
*** *** ** * * * **** **** ** ** * ******* ** ** ** * ** ** * ******* * * *** * * * ** * ** = a[i];
* *** *** **** * ** * ** * * ** **** *
* ******* * *** ***** *
***** * ** * ***** * ** **** = l;
** ** *** * ***** ** * * * ** * = s;

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

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
| 8.6k views
0 like 0 dislike
1 answer
[Exercise] Coding (C) - asked Apr 27, 2017 in C++
ID: 24390 - Available when: Unlimited - Due to: Unlimited
| 1.2k views
12,783 questions
183,442 answers
172,219 comments
4,824 users