Answer:
Iteration
Explanation:
The insertion sort is based on repetition of comparing one data array (or element in a list) with the others at its left to reorganize it, normally following a size criteria (from small to big or the other way around).
At each iteration, the algorithm takes one element and compares it one by one to the others until it fit the specified criteria. Later on, it creates a space, moving the other elements, to insert it. Later, it goes to the next element and the iteration repeats all the way through. It has some advantages over other sorting algorithms because it is easy to deploy and program it in many different languages, but at the same time it can be terribly slow when sorting large amount of data.
Answer:
a. daily
Explanation:
A webpage gets a new modification date whenever any change is made. This is irrespective of whether the change is large or small, significant or insignificant. Any update to the webpage will change its modification date. But this change will not be carried out automatically everyday unless an actual modification is carried out on that day.Otherwise it will continue to carry the modification date corresponding to the day of last update.
There are no options can u give options.
Answer:
DNS(Domain Name Services) is the correct answer.
Explanation:
DNS is the type of directory system which is distributed that finds the solution of a hostname which is readable by the human being. It is also critical in centralizing control of the confirmation and policies of the security in the environment of the domain with Active Directory. That's why the following answer is correct.