Register

Array

1,121 views
1 votes
1 votes
Consider X[1...n] and Y[1...n] be two arrays, each containing n numbers both of which already sorted. What is the time complexity to find the median by combining two arrays?

O(n)

O(log n)

O(nlogn)

O(loglog n)
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Na462 asked Aug 22, 2018
2,940 views
Calculating array address
Consider array A[1..100,1..100],in which elements are stored in Z representation. An example of 5x5 such array is shown below: Base address of array = 1000,size of each element is 1 Byte,and stored in row major, then address of A[100][50] ?
Consider array A[1..100,1..100],in which elements are stored in Z representation. An example of 5x5 such array is shown below: Base address of array = 1000,size of each e...
User Avatar
13 votes
13 votes
8 answers
3
Na462 asked Aug 22, 2018
5,595 views
Two dimensional array
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory as Row major,with base address as 1000,the address of A[66][50] is ..... Ans. 1361
Consider a 2 dimensional array A[40...95,40...95] in lower triangular matrix representation. The size of each element of array is 1 Byte.If array is implemented in memory...
User Avatar
0 votes
0 votes
1 answer
4
iarnav asked Jun 12, 2018
881 views
#DataStructure Time Complexity in Sorted Array.
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
User Avatar
Link Copied!