Answer: Parameters
Explanation:
Whenever a call to a recursive function is made, then the function has its own code and its own set of parameters with local variables. These parameters are within the scope of the recursive function. For example while finding the factorial of a number we are given the function with parameter such as int recursive(int n) where int n is a parameter passed into the function.
Since both arrays are already sorted, that means that the first int of one of the arrays will be smaller than all the ints that come after it in the same array. We also know that if the first int of arr1 is smaller than the first int of arr2, then by the same logic, the first int of arr1 is smaller than all the ints in arr2 since arr2 is also sorted.
public static int[] merge(int[] arr1, int[] arr2) {
int i = 0; //current index of arr1
int j = 0; //current index of arr2
int[] result = new int[arr1.length+arr2.length]
while(i < arr1.length && j < arr2.length) {
result[i+j] = Math.min(arr1[i], arr2[j]);
if(arr1[i] < arr2[j]) {
i++;
} else {
j++;
}
}
boolean isArr1 = i+1 < arr1.length;
for(int index = isArr1 ? i : j; index < isArr1 ? arr1.length : arr2.length; index++) {
result[i+j+index] = isArr1 ? arr1[index] : arr2[index]
}
return result;
}
So this implementation is kind of confusing, but it's the first way I thought to do it so I ran with it. There is probably an easier way, but that's the beauty of programming.
A quick explanation:
We first loop through the arrays comparing the first elements of each array, adding whichever is the smallest to the result array. Each time we do so, we increment the index value (i or j) for the array that had the smaller number. Now the next time we are comparing the NEXT element in that array to the PREVIOUS element of the other array. We do this until we reach the end of either arr1 or arr2 so that we don't get an out of bounds exception.
The second step in our method is to tack on the remaining integers to the resulting array. We need to do this because when we reach the end of one array, there will still be at least one more integer in the other array. The boolean isArr1 is telling us whether arr1 is the array with leftovers. If so, we loop through the remaining indices of arr1 and add them to the result. Otherwise, we do the same for arr2. All of this is done using ternary operations to determine which array to use, but if we wanted to we could split the code into two for loops using an if statement.
Answer: The tools which are required to accomplish each step in the data management process are:
1. Cloud Data Management tools.
2. Master Data Management (MDM) tools.
3. Reference Data Management (RDM) tools.
4. ETL tools.
5. Data visualization and analytics tools
Explanation:
Cloud Data Management tools with the help of various API's are able to connect multiples system with their data to the cloud. examples are amazon cloud, google API cloud.
MDM tools are used for creation and maintenance of reference data. example are Profisee
RDM tools is used with the MDM tools and are use to define the businesss processes over the reference data. Examples are Collibra.
ETL tools helps to load data of an organisation to data warehouses after transformation and testing the data pipeline constituting the data from different databases.
Data visualization analytics tools helps to extract and generate report from the big sets of data which can help an organisation to take business decisions.
Answer:
It will bring more verstality in his website. He will be able to define tags.
Explanation:
XML allows to define your own tags. You can bring semantics into your website which make data browsing easier.
B is better than any other one's I think.
