It would probably be the header.
Answer:
be effective.
Explanation:
A question can be defined as a statement that begs or requires an answer, response or reply.
Generally, there are four (4) main types of question and these includes;
I. Rhetorical question: this is a question that expresses a person's opinion but do not require an answer, reply or response.
II. Close-ended question: this type of question requires the respondent to give a yes or no answer.
III. Between the lines: it involves discovering an answer that is implied but not stated explicitly. Thus, the answer is hidden in the piece of information provided.
IV. Open-ended question: this type of question requires the respondent to give a detailed explanation rather than just a yes or no response.
When more open-ended questions are asked in a study group, discussions are more likely to be effective because the discussants get to share their opinions on the topic of discussion (subject matter) while considering other opinions or perspectives.
Hey! I just did the test and your answer is MAN.
Answer:
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages:
Simple implementation: Jon Bentley shows a three-line C version, and a five-line optimized version[1]
Efficient for (quite) small data sets, much like other quadratic sorting algorithms
More efficient in practice than most other simple quadratic (i.e., O(n2)) algorithms such as selection sort or bubble sort
Adaptive, i.e., efficient for data sets that are already substantially sorted: the time complexity is O(kn) when each element in the input is no more than k places away from its sorted position
Stable; i.e., does not change the relative order of elements with equal keys
In-place; i.e., only requires a constant amount O(1) of additional memory space
Online; i.e., can sort a list as