Register

Each row and column of a matrix is sorted find the position of any given element

• retagged by
636 views

1 Answer

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

Related questions

8 votes
8 votes
2 answers
1
radha gogia asked Jul 19, 2015
20,226 views
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
(A) Insertion Sort with time complexity O(kn)(B) Heap Sort with time complexity O(nLogk)(C) Quick Sort with time complexity O(kLogk)(D) Merge Sort with time complexity O(...
User Avatar
6 votes
6 votes
0 answers
2
V pandey asked Oct 8, 2022
3,048 views
5. Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume the first element is stored at A [2][2][2] and each element take 2 byte.
Consider a multi-dimensional array A [90][30]40] with base address start at 1000, calculate the address of A[10][20][3] in row major order and column major order. Assume ...
User Avatar
2 votes
2 votes
1 answer
3
yes asked Oct 6, 2015
1,384 views
the minimum no of comparisons required to find Majority Element in a sorted array (note that key is not given).
for example array contain a[1 2 3 3 3 3 3 4 5] then retun(1)
User Avatar
Link Copied!