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

87 Answers

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



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

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


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

}



int * *

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


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


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


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

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



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

{
* **** * ** * * ** i,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, * * * * * ***** **


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


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

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



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



int *

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


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


* ** * * **** ** *** * (n == 0)
* *** ** * * * * * * * ***** * **** ****** * * ***** ** numbers were * *
** *** ****** ** * * if (n == 1)
* ** ** **** ** **** * *** ** * * * *** one number was * *** **

** ** * * * * **
*** * ***** * *** * * **** **** ** ** ** * **** , Second **


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

}



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

{
* * * *** ** ** ** * * Your code here (Using pointer to finish)

}
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)

{
* * *** **** * * * ** * i,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. ** *** * ***
* **** * *** ** ***
* ** ** *** * ******* **** *** * ****** *** * *** ** * * * **** , Second * * * * *** * ****


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

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



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

{
* * * ***** * * * *** * i,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. *** ** **** * ***
** ****** * **** **** ** *
* * * ** ** * * *** ** * ******* * * ** * * * * ** * , Second ** * ** * ** * * ** *


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

}
answered by (-412 points)
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 (-581 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>



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

{
* *** * *** * *** ** i,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. * * * ** * *
*** * **** ** ****
** *** *** *** ***** * * **** * * *** ** * ** * * * * * , Second * * ** ***** * * ** *


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

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

void input_2 (int n)

{
** * * * * * * * *** * * i,a[1000];
** * *** *** *** ******* *** *
* * * *** * * * * *
* ** * * *** **** ****** *** ** ****** * ** ******* * * **
* * * ***** *
*** * *** * * ** * **** max=0,max_2=0;
* * ****** * * * ******

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

  }
* *** ** **** *** *** * %d, Second Largest: %d",max,max_2);



}

void input_1(int n)

{
* ** ** ** * ** i,a;
*** *** *** * * * * *** * ***
* * ** *** * * ** * *
* * * * * * * **** * ** * * *** * * * * *** ** * ** * ** *
* * * * ** *** * **
** * ** * * ** **** * **
** * * **** ** *** *** * ** * * * numbers were entered.");
** ** ** *** * * *
**** *** * * * * * * *** ********* one number was entered. Largest: %d",a);



}



void main ()

{

  int n;
* * * ***** ** * * * ** *** **
* *** ***** *** ** **
* * * *** *** * ** *****

  else
* * *** * *** ** *** **

}
answered by (-249 points)
0 like 0 dislike
Hidden content!
#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", &a[i]);


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


***** * * * * *** * (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, * *** **


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

}



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

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


** ****** * * ** **** * *** i<n; i++)
**** *** ** * **** *
*** * * *** * ** * * ** * ** * ** **** ** ** * ** * < a[i])
* ** * * * ** ** * * *** *** * * * *
** ** ** ****** * * ** **** * ***** *** * * ** * ** * * * * * * * = a[i];
* * ******** * *** * * * **** ** * ******* *** *** ** * ** * * = i;
*** **** ****** * * * * * *** ** ***** * **
** * ****** ** * **
* * *** * * * ** i<n; i++)
* * ***** * *** **
* **** ****** ** ** * * * * *** * * ** ** ***** * * * < a[i] ***** * ** i != b)
*** **** * * * ** * ***** ** *** * ** **
** * ** * *** * *** ** **** *** ** *** * ** *** * * * ** * * * * ** = a[i];
** * *** * ***** * ** ***** * ** * ** * *
* *** ** *** *

}
answered by (5.2k 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)

{
** * * * * * * *** ** ** i,j,b;
* *** ***** *** * ** * * i<n; i++)
*** * ** ** ** **** * *
****** * * * ** ** * **** * * ** * * ** *** ** * * ** j<n; j++)
* * * *** ** **** * * * ** ***** *** ** * * *
** * ** * ** * *** ** * ** ***** * ** ** * ** ** **** ** *** ** * ***
* ** ** ** *** * ** *** * *** * *** * ** * ** ** * ** ** ** * ** ** * *
* ** *** * * ** * * * ** * ** * ** ** ***** ** * * **** ** **** * ** * ** * *** * *
* * * * **** * * ***** ** * ** * * ** ***** ** * * ***** ** ******* ** * ******* ** * ** * * ** ***
** ** **** ** * **** ** ** * **** ***** ** ******* * ** * * * *** * * * ****
** * * * * ** * * ****** * ** * ** ** **** ** * * * * *
** *** * ** ********* ****** *** ** * ** ****
* ******** * **** * * ** *
*** * * ** *** * *
*** ** **** * * * ** * *** * *
* * ** ** ** **** *** * ** * *

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