Want this question answered?
Be notified when an answer is posted
9+9 and 9+9+9+9+9
7x9
3 times 9 and 7 times 9.
Oh, dude, there are like a bazillion different arrays you can make with 18. Okay, maybe not a bazillion, but definitely a lot. You can have arrays like [1, 2, 3, 4, 5, 6], [18], [9, 9], or even [2, 9, 7]. The possibilities are endless... well, not really, but you get the point.
Arrays having more than one dimension is known as multi-dimensional arrays. Multi-dimensional arrays is also known as arrays-of-arrays.
9+9 and 9+9+9+9+9
9
7x9
One efficient way to find the median of k sorted arrays is to merge all the arrays into one sorted array and then find the middle element. This method has a time complexity of O(n log k), where n is the total number of elements in all arrays and k is the number of arrays.
3 times 9 and 7 times 9.
Oh, dude, there are like a bazillion different arrays you can make with 18. Okay, maybe not a bazillion, but definitely a lot. You can have arrays like [1, 2, 3, 4, 5, 6], [18], [9, 9], or even [2, 9, 7]. The possibilities are endless... well, not really, but you get the point.
I assume you mean that you have a number of rows, and that not all rows have the same number of "cells". Yes, in Java a two-dimensional array is implemented as an array of arrays (each item in the top-level array is, in itself, an array); a 3-dimensional array is an array of arrays of arrays, etc.; and there is no rule stating that all secondary (etc.) arrays must have the same number of elements.
The median of two sorted arrays is the middle value when all the numbers are combined and arranged in ascending order.
Arrays having more than one dimension is known as multi-dimensional arrays. Multi-dimensional arrays is also known as arrays-of-arrays.
Arrays having more than one dimension is known as multi-dimensional arrays. Multi-dimensional arrays is also known as arrays-of-arrays.
1, 4, 9, 16
You cannot sort arrays by other arrays; that wouldn't make sense, anyway.