subarrayの例文

• To accomplish this, each subarray and bucket will have a state associated with it.
• Symmetry in the splitting network ensures that the same power is delivered to each subarray.
• In this base case, all elements from subarray i that belong to bucket j are added at once.
• Consider the follow basic strategy : iterate through each subarray, attempting to copy over its element at position " next ".
• Subarrays are sorted as the data comes in, not after all data has been placed into the subarray, as is typical in bucket sorting.
• Because of the amount of required computations, plane wave fitting is most effective for arrays with a smaller number of sites or for subarray configurations.
• Tagging the A blocks is performed times for each A subarray, then the A blocks are rolled through and inserted into the B blocks up to times.
• Analog phase shifters are biased through a single bias line, whereas multibit digital phase shifters require a parallel bus along with complex routing schemes at the subarray level.
• Distributed loaded-line TTD phase shifters, however, can be realized analogously or digitally, and in smaller form factors, which is important at the subarray level.
• If the boundary indices of the subarray being sorted are sufficiently large, the na飗e expression for the middle index,, will cause overflow and provide an invalid pivot index.
• It requires as a precondition that each subarray r in the range i, \ ldots, i + m-1 has its bnum [ r ] \ ge j.
• In computer science, the "'maximum subarray problem "'is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum.
• In computer science, the "'maximum subarray problem "'is the task of finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum.
• Once every and block of every and subarray have been merged for that level of the merge sort, the values in that buffer must be sorted to restore their original order, so an insertion sort must be applied.
• One variant of block sort allows it to use any amount of additional memory provided to it, by using this " external buffer " for merging an A subarray or A block with B whenever A fits into it.
• However, the tree may be unbalanced, with the deepest level partially filled, and equivalently, the array may not be divided perfectly by the search in some iterations, half of the time resulting in the smaller subarray being eliminated.
• The latter is a one-dimensional array of pointers, each of which may point to the first element of a subarray in a different place in memory, and the sub-arrays do not have to be the same size.
• The state of a subarray consists of an index " next " of the next element to be read from the subarray, and a bucket number " bnum " indicating which bucket index the element should be copied to.
• The state of a subarray consists of an index " next " of the next element to be read from the subarray, and a bucket number " bnum " indicating which bucket index the element should be copied to.
• This is reached when the search reaches the deepest level of the tree, equivalent to a binary search that has reduced to one element and, in each iteration, always eliminates the smaller subarray out of the two if they are not of equal size . }}