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

87 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>



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

{
* * * * ** * * * * i,j,swap;
*** * * * ** * * *** ****** *
**** * * *** ** * * **
** ** ** *** ** * *** * * * *

    {
*** * * * ** *** *** * * ** * * * * * **** **
** ** ******* * * * ** ** *** ****** ** * ** *** ** **** ** * *** * * *
**** * ** * *** * * * ** * ** * * * * ********* * * * ** ** ** **** ** * ****
**** **** * * *** ** * *** * * ********** *** * *** ** ****** * *
** * ** * ** ** ***** * *** * **** * *** ****** ** *
** ** * ** * * ****** * ** * **
*** **** * ** * *** ** * **** * * * *** *** ** ** ****** * ** ** *
* * * * ** *** *** * * * *** ** ** * * ** * * ** ***** *
* * * * ** *** * ****** * ** * *** * ** *** ** ** * ***** * *** * *


*** * **** **** * * * ** * *** *** ** *** *
* **** ** ** ***
* * * ******* *** *******
** *** * * ** * * * * * ** *
* ** * * *** ****** * * *** *

}



int main(void)

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


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


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

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

#include * * * * **



int main(){
* ** * ** *** ***** ***** array[500], count, i;
****** * * * **** largest, secondlargest;


*** ** * * ** * * ** * *** * ** ** ** * ** ** * * *


***** ** ** ** * ** * = 0; i < count; i++){
***** * * ***** * ** *** * *** * * * *** * * * * ** * **** * * **** ***
* * * * * * * * * ** *


* * * **** * * * * *** * * * = secondlargest = INT_MIN;


** ** * ****** ********* * = 0; i < count; i++){
* ** * ** * * ** * * ** ** ** *** * *** * * > largest){
*** * *** **** * *** * * * * ** ** ** ** * * **** *** * ******* ** ** ** = largest;
* ** * * ***** * * *** ** ****** * **** * ** ** * * *** ***** = array[i];
* * * * *** ** ***** *** *** ** **** *** else if (array[i] > secondlargest
* * * *** ** * ** * * ****** * *** ** * * *** * *** **** ** ** * * * * ** array[i] < largest){
** * * ** ** * ** ** **** * * ****** * ** ** *** * * * * * ** * ** ** = array[i];
* * **** * ** * ** ** ** *** * ****** * ** * *** ***
** * * ** ******* * ** * *
** * ** * *** * * * * * * * ** * : %d, Second Largest: %d", largest, *** ** **


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

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

#include * * * *



int main(){
* *** *** ** ** ** **** * * * array[500], count, i;
****** ** * * * * ** ****** largest, secondlargest;


**** * *** * * * ***** ** * ***** * * * * * *


** ***** ** * ** **** = 0; i < count; i++){
* ** ** *** * * * ** ***** * *** * * * * * * ** * *** * **
**** * ** * ** * **


*** * * * **** * ** * * = secondlargest = INT_MIN;


* ** * ** * * * * * ** = 0; i < count; i++){
* * ** ** * * ** * * * * * ** ** ** **** * ** * ** > largest){
*** * * * * ** ** * ***** ** * *** ** * * ********* * ** * ** = largest;
* * **** ** ** * *** *** * ** * * ** ** ** * ** * **** * *** * * * * = array[i];
** * *** ** * * * * ***** *** * *** * else if (array[i] > secondlargest
***** * * **** *** * ***** * *** * ******** * ** * * * * *** array[i] < largest){
* * *** * **** * ** ** * * * * *** *** * ** *** ** * * ** * * * = array[i];
* * *** * * * **** * * *** * ***** * ** * *
* * ** ** * ** ** *
* * ** **** *** * * ** ****** * ** ** ** : %d, Second Largest: %d", largest, ** ***


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

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

#include *** * ** ***

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



int main(){
***** * * ** ** ** ** * * array[500], count, i;
**** * ** ***** largest, secondlargest;


* ** *** * *** ** * ** ** ******* * * *


** * * * *** * * * * = 0; i < count; i++){
* * * * * *** ** * * * * * * ** *** * **** ****** ** * * * *** *
* * * **** *** * * *** *


** * ** * * *** * * = secondlargest = INT_MIN;


* * * ** *** * ***** * = 0; i < count; i++){
** ** **** ** ** ** * ****** ****** ***** ** * *** * > largest){
* * ** * ** * ** * * * ** * *** ****** * * * *** * *** * ** * = largest;
** ** ** ** ** ** *** * ** * ** * * * **** *** ** * * * **** *** = array[i];
** * *** **** ******* ** ***** ** * ***** ** * * ** else if (array[i] > secondlargest
** ****** * *** **** **** * * ** * **** * ** ** * * ** ** * * ** * * * * ** array[i] < largest){
* * * ** * * * * ****** * * ** * * * * * ****** * **** ** ** * * = array[i];
**** ****** ** * * ** * * * **** * * *
****** ** * **** *** *****
* * * ** *** ** * ** ** **** *** * : %d, Second Largest: %d", largest, * **** **


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

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



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



int *** *

{
** *** * ** int n, largest, * ** * *
* *** * *** *** * * ** *** ** will be entered
*** ** * * *** int a[n],i;
***** *** * *** * * * * * *** * n integers ** by spaces
**** ** for (i = 0; i < n; i++)
* * * ** * ** ** * * ***** * * * *****


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


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


**** ** *** return 0;

}



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

{
** * *** * ** // Your code here (Using pointer to finish)
** *** * **** int i;
*** ** ***** *** **
** * *** **** * * **
*** for(i=0; * * i++)
*** **** ** ** ****
* ** * ** * ** * * ** ** * * * ** * ******* **
**** *** ** ** * * * ** * * * * ** ******** *
* * *** **** * ************** * ** * **** ****** *** * *** ** ** ** * ****
* *** * * ***** * * ****** **** *** **** ******* ** **** *** * ** * *** * *
**** ** ** ** * **** ** * **** * ** ** * ******* *
** * * * ** **** **** ** * *** * * **** if * **** ** * * * * ** * * * **** ******
* * * * *** * * *** * *** * * ** * **
*** ** *** *** ** **** *** * * ** * ** ** * ** ******** ** ** * *
** ** ***** * * * ** ** * ** ***
** * ** * * * * * *

}
answered by (-190 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 find_two_largest(int a[], int n, int *largest, int *second_largest)

{
** * ** ** ** *** * ** * Your code here (Using pointer to finish)
*** * * * * ** * * i;
* ** * * * * ** * ** **
* * * ** * *** ** ** **
** * * * * * ***** * ** * i<n; i++)
* * ***** *** * * **
*** * ** * * ** * ** *** ** *** * ** *** * ** * * * * * *
*** * * ** * ****** ** ** ** * ** **** ** * * ****
* ** ******* * * *** *** * * * * ** * *** **** * * ** ** * ** ****
*** * ** ***** * ** * * ** * *** ***** ** * *** ** ** * ** * ** * ****
** ** * **** ** ** * ** * * * **** ** ** **
* * * ******* ** * * *** **** ***** * *** * **** ******** *
** * ** ** ** * ***** ** ** *** * * **
**** ** * ** * ** * * *** * * ** * ** *** * ** ** * * ** * ** *
* * * * * ** ***** * ** * *** *** ** * *** *** *
* *** * ** * * * * ***
*** ******* * ***** *** largest;

}
answered by (-190 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



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



int main(void)

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

}



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

{   int temp = a[0];
** * ** * ** * ** **** * i,b,c;
** *** * * * * * * * ** * *
** * * ***** **** * * * *** *** ** ****** **** ** ***
**** * * *** * * ** * * * ** ** ** ** ** * ** *** *** * * * = a[i+1];
* *** ** *** ***** * *** * * * ***** ** *
* *** * ***** ** *
*** ** * ** ** *** * * = temp;
* ***** ** ** * *
* ** ** ** ***** * **** * list = temp;


***** * * **** *** * ** != a[0]){
*** ***** * * * * * * *** ** *** ** * *** * temptwo = a[0];
* ** ** ** ** * **** * * * * ******* * ***** ** *
******* * *** * * * ** *** ** ** *** * * ** *** **** ** ** * ** * && a[c+1] != list){
** ** ** * ** *** * * ** * * * ** **** ** ** *** * * ** * *** ** * ** * ** * ****** * ** *** ** = a[c+1];
* ** *** ** *** *** *** ** **** * **** ******* **** * * ** * * ***
* * ** **** * ** ***** * * *** * ** ** *
* ***** **** ** ** **** * ** ** ** * * ** ** * * **** * * * ** * ** ** *** = temptwo;
******* * * **** * **** **
** ** ** * ** * ** * ** if(list = a[0]){
*** * * ** ** ***** ** * * ** ** * **** * **** ** ** *
* ** * *** **** ** * ** ** ** ** *** * **** * * *** * * *
* *** ** *** * ** * *** * * * ****** * ** * *
** * * ** * *** * *** *** * * ** * * * **** ** ** ***** ** ** * ** * * = a[b+1];
* ** *** * ** ** ***** ********* * ** * *   
** * ** * ******* **** *** **
** ** ** ** *** * * *

}
answered by (-134 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()

{

    int i,j,num[100],n,z=0,only;
** *** * ** * * ** ** * ** * * * * ** *
* * ** * * * **** * **

    {
** ** ***** * * ** **** * * * * ***** * *** **** * numbers were entered.");

    }
** * ** * * * *** * ** if (n==1)

    {
* * ** *** * ****** * *** ** ** * * *** *** * * *** ***
* *** ** ** * * * * *** *** * *** ** ** ****** * ** one number was entered. Largest: %d",only);

    }
* *** ** * ** **** ** * *

    {
* ** ** ** * ** ** * ***** *** *** ** * ** * i<n; i++)
*** *** *** *** * **** * **** ** * * ** *** *
* * * * * * ** * * * * *** ** *** * * **** * *** ** ** * ** * *** * ** * * *
* ** ** *** * ** * * ** * ** ** *
** ** ** ** ** * * * ****** **** ** * * ** ** * * ***** * i<n; i++)
** * * ** *** * **** * * * * * ** ** ****
** ***** * ******* *** ** * *** * ** * ** *** **** **** ***** * j<n/2; j++)
* * * **** * ** * * * * * ***** * ** * ** * *** * * * * *** *** *
*** * * **** ****** *** **** **** * * **** * * ** * ** * * * ** ** *** * *** ** *
* * *** *** ** * * * * * **** ** *** * * * * *** * * * *** *** * *** ** *** ** * * * ** ** *
**** ** * *** * * * * **** *** * ** **** * * * ** * ** ** ** * ** * * * **** ** ** ****
* * *** * *** * * * ** * *** ** * * * * * *** ** * * * ** * ** * ** **
*** * *** ** * * * * ** * * *** * *** *** ** *
* ** * * * ** * ** ** * *** ** * * ** * *** * **
* * * ** * * *** ** *** ** ** * * * * *
** * ** * ** *** ** ** * * **** *** * ** ** ** ** * * *** * * *** **** ** * ",num[i]);
***** ** *** * **** ****** *** ** ***** ** * ****
* ** * * * * ** * * ** *** * ** ** * * *** ** * * ** ** %d, Second Largest: %d",num[n-1],num[n-2]);

    }


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

}
answered by (-324 points)
0 like 0 dislike
Hidden content!
* ** * * * *** *



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



int *

{
* * * * * int n, *** * *** **
** ** ** * ** * * * * * * * * * * * will be entered
* *** ** int a[n];
**** ****** *** * ** * n **** **** by spaces
** *** for (i = 0; i * * n; i++)
* ** * ** *** * ****** * * ** **** ***** ** * ***


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


*** ** if (n == 0)
* * ***** * * * *** ** * * ****** * **** * *
** *** ** else if (n == 1)
*** ** * * * *** **** ** * ****** * one number was ** * * * * * * **
* * *** else
* * * * * ****** * ** * * * * ** ** ** ** * ** ** %d, Second ** * *** ** * * ****
* ** * ***** return 0;

}



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

{ * * * *** ** temp = a[0];
* * *** * ** int i,b,c;
* *** * * *** ** ** *** * ** *** *
* * ** **** ** ** *** * * * ** * *** *
** * *** **** * * * * **** * * * ** * * temp = a[i+1];
** * ** * ******* }
* * * * }
*** **** * * ** * = temp;
** *

*** ** * * int list = temp;


* **** ** ** *** ** * != a[0]){
** * ** *** * ** *** * * * int temptwo = a[0];
* * * * ** * *** * ***** ** *
*** *** * * * * * * * **** * *** * ** * * * * * ** a[c+1] != list){
* **** * ** * ** **** **** * ** * ** * * * * ** * ** temptwo = a[c+1];
* * * *** ** *** * *** * * * ** }
*** * * * *** ** }
* * ** * * * * * * ** * ** **** * * ***** = *
*** * * ** }
*** * ** * else if(list = a[0]){
* * * * ** * * ** * * ** * a[0]=0;
* * ** * * ** * *** * * * * * ** * ***
** * ** *** *** ** * *** * ** * ** * ** ******
** ** ** * * * * * *** ** * * **** *** * * * ** *** * *** * * = a[b+1];
** * * ** * * ** * *** ** * * *

* ** * * * ****
** * ** **** * }

}
answered by (-134 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

int main()

{

    int i,j,num[100],n,z=0,only;
** ** * * **** *** * * * * ***** * ** * *
*** * * * * **** *** *

    {
** ** ****** * *** * * * * * * ** * * ** * * ** * **** ** ** numbers were entered.");

    }
** * * * ** * * ** * if (n==1)

    {
**** ********** ** *** ******* * * * ** ***** *** * * * **** * *
** * **** * * ** * * * * * *** * * ** * * *** * * one number was entered. Largest: %d",only);

    }
*** * * * ** * * ** * ** *

    {
* * *** * ** *** * ** * *** ** * * ***** i<n; i++)
** * ** * ******* * * ** **** * **** ** *** * ***
* **** * ** ** ** *** *** *** ** *** ** ***** * * * * ***** * ** ** *** * **** * **
***** * *** * ** ** *** ** * *
*** **** ** * ** *** ***** * ** ** ** ** ** i<n; i++)
* ***** *** **** * * * ** * ** * ****
* ** ** ** *** ** **** * * ** * ** *** ** ** *** ** j<n/2; j++)
** * ** * *** *** * *** *** * * *** * ** * * ** *** * * ** *
* ** * * ***** * * *** **** * ** ** * ** * * ** ** *** ** * * * ** * * ** ** *** ** *
* * * * * * ** ******* *** * **** * ** * * * ** * *** ** *** *** **** ** * * * * *** * *** ** * *** * **
** * * **** ** *** *** ** * * * ****** ** ** ** ***** *** ** * * ******** ***** ** * **** * ***
* * * * ** ** *** * * * ** * * * ** * *** *** * * *** **** **** * ** ** **
*** *** ** ** *** *** * ** * *** ** * *
* * ** *** ** ** ** * * ** * ** *** * * *** *** *
* * ** ** * ** * ** * ** *** ** *** *** **
** ** ** ** * ** ** * ** ** **** * *** * * * ** ****** *** ***** **** ",num[i]);
** *** * *** ****** * ** *** ** ** ** *
*** ***** * ** ** * * ** *** * **** *** ***** *** * * * * %d, Second Largest: %d",num[n-1],num[n-2]);

    }


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

}
answered by (-324 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.71.254.51
©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
| 4.1k views
0 like 0 dislike
1 answer
[Exercise] Coding (C) - asked Apr 27, 2017 in C++
ID: 24390 - Available when: Unlimited - Due to: Unlimited
| 563 views
12,783 questions
183,442 answers
172,219 comments
4,824 users