0 like 0 dislike
18.8k views

We will use this function to proceed and store the result 

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.

寫 find_two_largest() 函數。陣列做為函數參數 找出最大值跟第二大值。

Finish the code below to match the input and output. Pointer is 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)
		// Your code here
		//Print No numbers were entered.
	else if (n == 1)
		// Your code here
		//Print Only one number was entered. Largest: 
	else
		// Your code here
		//Print 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 Chapter 12: Pointers and Arrays
ID: 38251 - Available when: Unlimited - Due to: Unlimited

edited by | 18.8k views

58 Answers

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
* * ***** ** * *
** ** *** ** * * * ** c;
* * * *** * * * ** * = getchar();
* * * *** * **** ** * *
* **** *** ** * * ** *** ** * * * * * * * numbers were * **** * *
* *** * * *** * * * * * *** ** ** *** 0;
* **** * ** * ** * * **
* **** * ** *
** **** * *** ** * * a[n];
* ***** ** * * n integers separated by spaces
* ** * ** *** * * *** * i = 0;
**** ** * * * * *** * * ** (; i < n; i++)
*** * * * *** * * * * * * * ** ** *** * ****** **** %d", &a[i]);

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

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

* * **** * ***** * ** 0;
}

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

** ** * ** **** ** * * ****** i=1;
* *** * ** **** * * ** * * * ** * * * *
* **** * ** *** * ** * ** ** * ***** * **** * * *
***** ** * ** * **** * *** ** * * * **** **** ** * *** ** * * * * * * ** *
* ** ** *** * *** ** *** **** * * ** * ****** *** ** ** * ** * **** ***
**** ** ***** ** * * **** ** * ** * ** ** * * **
* * * * ** * ** * *** * * ** * ** * ** ** * * ** ** *
** **** * * * * * * * ** *** * *** **** * * ** **** * ** * *
* ***** ***** * * **

** * ** ***** ** * Your code here (Using pointer to finish)
}
answered by (52 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
* *** ***** ***

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

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

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

*** *** ** if (n == 0){
* * * * * * * ****** // Your code here
* * ** *** ** ** * * *** *** * * * * **** **** * were * * *** *
* *** **** **** * ** * *** No * * were * *
***** ** else if (n == 1){
* * * ** * * **** ***** * // Your code here
* *** *** ** *** *** * *** * * * **** * ***** * one number was *** * *** * * *
* * * * **** * * * ** Only one number was * ** ***
* **** * ** else{
* ** *** *** **** // Your code here
** ** ** ** **** ** **** * **** * * * *** * ** *** * * * * * * ** %d, Second * * ****** * ** * **
** * * *** * * ** * , Second **

* * * **** return 0;
}

void * * ** * a[], int n, int *** int * *
{
* * ** ** ** ** // Your code here (Using ***** to *
* ** *** ** int i;

*** * ** * * * = 0;
* * * * * * ** * ***
** * ** **** * *** * *** * ** * ** ** * *** ** *** ** ****** * ** *
** * * }

* ** * * *** * * ** * * = 0;
** *** ** * ** * **** *
* * ** * ******* ** * * ** * * * ** * * * *** *** * **** * ****** * * ** * * * *
* * *** }
}
answered by (-286 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
* * ** ** ** *** *

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

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

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

* * * * if (n == 0)
* * * * * ** * *** * * * ** * * ** ** were ***** * *
* *** **** * * * * ** // Your code here
**** ** ** * * * ** * * No * * were * *
** * ** * *** else if (n == 1)
*** *** ** * *** ***** * ****** *** *** * * * * ** one number was * * * ** ** ***
** * **** * ** ** *** // Your code here
* *** ** * * * ** ** * * Only one number was **** * *
* * ** * ** else
*** ******* ** ***** * *** ** * %d, Second * * *** ** * * * **
** ** * ** ** ** *** ** // Your code here
** * *** * *** * * *** * * ** , Second * * **

** * * return 0;
}

void *** * ** * * a[], int n, int ****** int * *** * **
{
**** *** * * *** * ** i;
* * ** ** ** * * *** ** *** = ** ** ** = 0;
**** * * **** ** * * (i = 0; i * * * n; i++)
{
* * * * * **** * (a[i] *** ** ****
**** **** * ** * ** * ** *** * ** *
* * * ***** * * ** ******* ** * ** * * * ******** ***** * ***** =
*** * * *** * ** **** ** * ** ** *** ***** ***** ** = a[i];
*** * **** * * ** * *** *** * * *
* * *** * * ** * ******* (a[i] ** ** * **** * ** a[i] ** * **
* * * * *** * **
** * ** * * *** * * * ** * *** * ** = a[i];
******* ** ** **
* * ** * // Your code here (Using pointer to finish)
}
}
answered by (-196 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include * ** **** **

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

int main(void)
{
* *   int n, largest, ** * **
* *   * ** ** * * * ** ** ** //Numbers will be entered
****   int a[n],i;
* ** ** * * * * * n integers separated by spaces
*** * * * * * ** * * * * ** *
* ** **** **** ****** * ** ** * * *** *** ** * * * *** * ** * *
* *   * ** *** * * n, **** ** ***** ******* **

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

void ***** * * ** a[], int n, int *largest, int *** * **
{
** * *   int i;
* **** * * * * * * **** **
* **** * * ** * * ******** *
* * ** ** ** * *
* * ***** ******* ** ***** ** * * * * * ** * * *****
**** * * * * **** * ** * * * ***** ** * * * * ***
*** * * * ** *** * * * ** ** *** * * * * * **** *** *** * *
* **** ***** * ** ******* * **** *** * * * * ** *** * **** ** *** **** ***
* ** * * *** * ** ** * ** ***** * * * ****
** * * * ** ** *** * * * * * * * * *** *** * ** * ***** * a[i] > ** *** **
* * *** * *** * * ** *** *** *** * *** * ** *
** ** ** ** * * *** ** * ** * * * ******* *** ** ** ** ****** **** ** ** **
*** * **** * *** ****** * *** * * ** ** ****
** * * *** * *
}
answered by (-498 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
** **** ***** * ** *

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

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

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

*** * ** if (n == 0)
* ** ** * ** * *** * * * * * **** were * * * * ****
* * * * * ** * * ** // Your code here
* * * ** ** * *** * ** * *** No * were *
***** * * else if (n == 1)
* *** ** ** * **** * ** * ** * * * ** ****** *** one number was * * * ** *** *
** ** * * * ** ***** * // Your code here
** * * * * * * * * Only one number was **
***** * else
***** **** * ** ** ** * ** * *** * * * * %d, Second * * * * ** ** * ** * **
** * ** * * ** * * * // Your code here
* ** * ** * ***** ** ** ** ** , Second ** *

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

void * ** ** ** * a[], int n, int ** int * *** *
{
* * * **** * ** * **** * ** i;
* * * * * * * ***** * * ** * * * = ** **** = a[0];
* * **** *** * * * ** * * (i = 1; i * * n; i++)
{
* * * * ** * * * ** * (a[i] *** *
*** * ** *** * *** ****
* * * * * *** * * **** * ** * * * * * ** * ** ** *** = ** **
** * ** ** ** * * ** ****** *** * ** ** *** * *** ** = a[i];
* *** * ** * *** ** *** * *** **
* * * * * ** ***** * (a[i] * ** * ** ** ** * * a[i] **** **
**** *** * ***** ** ******* * *
** * ** * ***** * * * * * **** * * * * ** = a[i];
* * ** * *** * * * * ** ****
* ** ** * * // Your code here (Using pointer to
}
}
answered by (-196 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
* ** ** * **

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

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

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

* ** ******** if (n == 0)
* * * * ** * * ** // Your code here
* **** * * ** * * ** * * ** * * numbers were *** *
* * ** ** *** //Print No numbers were entered.
* *** *** else if (n == 1)
* * ******* * * ** ****** // Your code here
**** ** * * * * * * * ***** * * ** * one number was * * * * *** * * *
* ** * * * * * **** *** * //Print Only one number was ** * *
*** ** ******* else
* *** *** * ** ** // Your code here
** ** ** ** ** * ** * * * * *** * %d, Second ** * * **** * ** *** * * *
* * * ** * *** ** ** //Print * , Second **

*** * * * return 0;
}

void * * a[], int n, int * int * * *
{
**** ** // Your code here (Using pointer to finish)
**** * ***** * ** ** i,j;
* * * **** * * *** *** ** *** ** ** * * *** * *
** *** * ****** * ****** ** * * ** * **
* ** ****** * * * *
*** ****** ** ***** *** ** * * * ** **** * * *****
** * *** * ** * * ** * ** **** ** * **** * * ** *** ***** * **** *
*** * *** * **** *
* * * ** * **** ** * ****** *
***** * * * *** * ****
** **** **** * *** * * ******* * ** * * * * * ** ** **** **** *** ** * *
*** * ** ** * ** * ***** *** * *** * *** ** * * **** *** **** * *
** *** ** * *** *
}
answered by (-249 points)
edited by
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Wrong output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Wrong output
Case 3: Correct output
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
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];
* * * ******* char c;
** * ** * * * * **
* ****** *** ** * * * *
** ** *** * **** **
** * * * * * ** * *** *** * ** ** ** * *** * ** numbers were ** ** ** *
* ** *** ** ** * * ** **** ** *** * * * **** *** 0;
** ** *** ** * *** ** ** *
* * * **** ** * * * ** * *** n integers separated by spaces
*** * * * * **** * * * * i=0;
* * ** ** ** ******* ( i = 0 ; i < n ; i++)
** ** * ** * * ** *** * ** *** * * * ** * *
*** * ********** * *** ******* * ** **** **** ****** ** **** * *** %d", &a[i]);
** * * * ** * * * ** * * * * ***
****** * * * * ** * * ** n, &largest, * * ** ** *

** * ** ** * *** ** * * ** (n == 0)
* * ** * ** *** ** ** * * * * * Your code here
** * *** ** ** **** ** * *** *** **
****** * * *** * ** * * * ** * ** ** ** * ** * * **** * *** * * ** * ("No numbers were * ****
** ** * ** ** *** ** *** * ** * * **
* * ** * * * ** **** if (n == 1)
* * * * ** * * * ** * * ****** * * *** **** Your code here
* **** * * ** ** ** **** ** * **** ** ***** * ***** * one number was entered. Largest: %d",a[0]);
** *** * * * * * ** * * *** ** **** * **
* * * * ** ** ** *
* ****** ** * **** ****** * ** * * * ** ****** Your code here
**** ***** ******* **** * * *** ** * * * * * *** * ** ** %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=0;
* *** * * ** * * * ** ** j=0;
* * * ** ** ** * * * * = *second_largest= a[0];
**** * *** *** * * ** * ** (i = 1; i < n; i++) {
* ** **** * **** * (a[i] > *largest)
*** * ******* *** ** * *** * *
*** **** * * ** *** * ** ** ** * * * **** **** * ** * * * * ** * * ***** = a[i];
** * * ** ** ** * *** * * * * * **
** * * * * * * * * * *** * * (j = 1; j < n; j++)
** ** **** *** * * * *** * ** * ** *** * ** ** * *second_largest && * * ***
** * * * ** * * **** ** *** * *** * ** ****
* * *** ****** ** ******* *** ** **** * * ** * * * * * *** ** ** * ** * * * *** = a[j];
** * **** * *** *********** * * * **** * * *
* * * * ***** * ** ***
}
answered by (-329 points)
edited by
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 0
-----------Re-judge-----------
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include ** * *

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

int ** *
{
***** ** int n, largest, * ** **
** ** * *** * ** * * ****** //Numbers will be entered
* *** ****** * int a[n],i;
* * * * * ** ** **** * 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;
}

void * * * a[], int n, int *largest, int *****
{
**   int i;
* **** ** * * * *
*   * ** *****
* *****   for * *******
*** * ** *
* ** **** ** ** * * * * ****** * * ** * ** ** *
** *** * ***** * * * ** * ** * ** * * *
* *** ** * ****** * * * ****** ** **** * * * *** * * * * *** *** *** ** *
* * ** ** ** * * ** ** ****** * * * ** *
* ******* **** ** * *** *
***** *** ** * * * ** * * *
* ** *** ** *** *
*** * ** * ** * ****** ** * * *** * ** ** * ** **** **** *** *** * **** ** ** **
*** * * ********* ** * ** * ** * * * **
* * * * **** ** ** * ** ** * ***** * ** * **** * * * *** *** **
**** ** * * * * * * * ***** * * *** **
* * ** * **** *** ***
}
answered by (-249 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include * * * * ** *

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

int ** **
{
* * ** int n, * ******* * **
* * ** ** * ** * * ** **** * * * * will be entered
*** * * ** int a[n];
* *** * char c;
** * * * * *
***** * *** * * * **
* *** **** * * *** ****** * *
* * ** * * * * *** ********** * * * *** * ** * ***** **** * numbers were *** *
* ** ** * * * ***** ** *** * * ** *** ** * * 0;
* * * * * *
* * * * * *** *** * * * n integers * * by spaces
* ** * int i=0;
*** * ***** for ( i = 0 ; i < n ; i++)
* * * * **** * *** *** *** {
** * * * * * *** ** *** *** ** * * * * ** * * ** * ** * ***** *
* **** ** *** * * ** ** }
* * ** * * **** **** ** n, * ** * ***** ** ** **

***** *** if (n == 0)
* *** * * ****** * // Your code here
* * * ** ** * ***** {
* * *** ** * ** * * * * * ****** * * ** * * * * * ** * * ** numbers were ****** * * *
* * *** * * * *** * ** }
***** * * * else if (n == 1)
* * * *** **** * * * {// Your code here
* * * * * ** *** *** * * * * * one number was * * ***** * *** * *
** * * ** ******** * * * }
** *** * else
* * ** ** ** * * * {// Your code here
*** **** ** * * * * * ***** ** * ** %d, Second * ** * ***** *** *** * *
** * * * * * * ** *** * }
* * * ******* return 0;
}

void * ******** * a[], int n, int **** int ** *
{
******** ** * // Your code here (Using pointer to finish)
** * * * ** ** int i=0;
* * **** int j=0;
* * * *largest = ** * ** ** a[0];
*** * * * for (i = 1; i < n; i++) {
** * * * ** * ** ** * * * (a[i] > ******
**** * * **** ******** **** * * *
* * * * * ** * * * * ** ** * * * ******* *** * ** ** * * * ** = a[i];
** *** * * ** *****
* * * * ** ***** * * ** * ** (j = 1; j ** * n; j++)
* * * ** ** * **** * ** * ** * * ****** * * ** *** * * *******
* ** * * ** *** * * ** * * * * **** *** * * *
* * *** ** **** * * *** * ***** *** ******* * ** ** * * ** * ** * *** * = a[j];
** * * *** * ** ** * * * ** **** ***** * *
*** * ** *** ** * }
}
answered by (-329 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
** * * * * *

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

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

** * * ** if (n == 0)
* * * * *** * * *** // Your code here
* * * * ***** ** * * ** * {
*** ** * * * ** * ** ** **** * * ** ***** ** ** **** numbers were **** * *
** * ** * * * * * ** }
* ** * * ** else if (n == 1)
* *** * * * *** {// Your code here
***** ** * *** ** * **** ** one number was ** * *** * * * *** ***
* ** ** **** *** ** ** }
****** * * else
* * ** * *** **** * * {// Your code here
* * **** ** * * **** * ** *** * **** * %d, Second ** *** * *** * **
* *** * * * * * ** ** }
*** * ** *** return 0;
}

void * * * a[], int n, int * *** int ** **** *
{
* * // Your code here (Using pointer to finish)
* *** ** * * **** int i=0;
* * * ** * int j=0;
* *** * * * * * ** = **** ** ** * a[0];
**** * *** for (i = 1; i * * n; i++) {
*** * **** *** *** *** ** (a[i] * * *** *
* ** * *** * * * * * ** ** * *
* ****** *** ** * *********** *** ** ** * * * ** * * ** * * *** * *** = a[i];
*** * * ** **** ** ** ** * **
* ** * * ** *** **** ** ** ** (j = 1; j * * n; j++)
**** ** * ** * * * * **** *** * * ** ***** ** **** * *** * **
* * * * * **** * * ***** *** ***** * * *
***** * ***** * * ** **** *** ** * * * ** * ** **** ** * * * ** * * * = a[j];
***** ** * * * ** * *** ** * * * * *
* *** *** * }
}
answered by (-329 points)
0 0
Case 0: Correct output
Case 1: Wrong output
Case 2: Correct output
Case 3: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:162.159.115.10
©2016-2026

Related questions

0 like 0 dislike
30 answers
[Exercise] Coding (C) - asked Dec 21, 2017 in Chapter 11: Pointers
ID: 38255 - Available when: Unlimited - Due to: Unlimited
| 11.3k views
0 like 0 dislike
58 answers
[Exercise] Coding (C) - asked Dec 21, 2017 in Chapter 12: Pointers and Arrays
ID: 38252 - Available when: Unlimited - Due to: Unlimited
| 16k views
12,783 questions
183,442 answers
172,219 comments
4,824 users