Answer:
#include <iostream>
using namespace std;
void findDuplicate(int arr[], int size) {
for(int i = 0; i < size; ++i) {
for(int j = i+1; j < size; ++j) {
if(arr[j] == arr[i]) {
cout << arr[j] << endl;
return;
}
}
}
cout << -1 << endl;
}
int main() {
int arr[] = {2, 3, 5, 6, 11, 20, 4, 8, 4, 9};
findDuplicate(arr, 20);
return 0;
}
Explanation:
A sort function sorts in an ascending or desceding order
The true statement is that the function would sort in decreasing order.
<h3>What is a sort function?</h3>
A sort function is a code segment that is used to reorder a list in ascending or descending order, when called or evoked
<h3>The order of the sort function</h3>
The code segment is given as:
if (list[index] < list[index + 1]) {
temp = list [index];
list[ index] = list [index +1];
list[index +1] = temp;
}
In the above code, we can see that the code compares a list element with the next element on the list, and the larger value comes to the front
This means that the sort function sorts in decreasing order
Read more about code segments at:
brainly.com/question/16397886
Answer:
insert, illustrations, click and drag, slide show
Explanation:
i got it right
