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: URN(Uniform Resource Name) is the basically a subset of the Uniform Resource identifier(URL). It uses "urn"scheme for the working an implementation. Uniform resource name functions by identifying components uniquely through their name.
The most common example of URN is ISBN (International Standard Book Number)number which helps in the unique searching and identification of book.
Answer:
If your on pc like me use ad blocker I do that but otherwise watch the add press ok after if it dosemt work tell me I’ll try and find you it and for ad blocker you also can have a jailbreak divice and to get and blocker go to chrome extension website search up pop up ad blocker
Explanation:
Answer:
Option A is the correct choice answer for the above question.
Explanation:
In an MS-Powerpoint document, when a user wants to copy the selected shape and drag that shape for use in slides then he needs to--
- Select the shape
- Press the Ctrl key and
- drag that shape on the slide of the powerpoint.
Then the user gets the shape on the slide for their personal use.
The question scenario also suggests the same which is described above. hence Option A is the correct answer while the other is not because--
- Option B suggests 'ESC' which is used to escape any running program.
- Option C suggests about ALT key which is of no use for the MS-Powerpoint document.
- Option D suggests about TAB key which is used to make the space between two texts or diagram.
