u can merge first two rows and proceed two at time.then slowly merge 4 at a
tym and so on.a recursive algo will do
On Mon, Feb 7, 2011 at 6:25 PM, Ashish Goel wrote:
> yet to test...
> will download xcode to compile, not on linux or windows (:
>
> remote case of all both entries in last
yet to test...
will download xcode to compile, not on linux or windows (:
remote case of all both entries in last row or last col needs to be looked..
int ai=1; int bi=0;int aj=0; int bj=1;
int row = 0; int col=0;
printf("%d \n", a[0][0]);
while ((aiwrote:
> here is the counter example.. below e
hmm ya u need an extra K array but i think soln is fast do U
On Mon, Feb 7, 2011 at 3:11 PM, jalaj jaiswal wrote:
> for merge sort extra space will be needed
>
>
> On Mon, Feb 7, 2011 at 3:10 PM, arpit busy in novels <
> arpitbhatnagarm...@gmail.com> wrote:
>
>> Hey i m just a newbie To group BT
for merge sort extra space will be needed
On Mon, Feb 7, 2011 at 3:10 PM, arpit busy in novels <
arpitbhatnagarm...@gmail.com> wrote:
> Hey i m just a newbie To group BTW from MNIT jaipur 3rd yr CS
>
> I just though we should apply merge sort < mean merge 2 array into one )
> on 1st row & 1st
Hey i m just a newbie To group BTW from MNIT jaipur 3rd yr CS
I just though we should apply merge sort < mean merge 2 array into one )
on 1st row & 1st column wrote:
> isn't mnlog(mn)(simple quick sorting the entire array) better then
> mnlog(m+n)
>
>
>
> On Mon, Feb 7, 2011 at 2:46 PM, sunny
isn't mnlog(mn)(simple quick sorting the entire array) better then
mnlog(m+n)
On Mon, Feb 7, 2011 at 2:46 PM, sunny agrawal wrote:
> one of the possible methods is to use concept same as EXTRACT-MIN of heaps
>
> do the following steps *m*n *times
> 1. print a[0][0] ans replace this by a[m-1][n-1
one of the possible methods is to use concept same as EXTRACT-MIN of heaps
do the following steps *m*n *times
1. print a[0][0] ans replace this by a[m-1][n-1]
2. call REORDER(0,0)
in REORDER(i,j) function we perform following operations to make array's all
row's and column's sorted
1.if a[i,j] <=
here is the counter example.. below every row is sorted and every column is
sorted
0 2 3 4
0 3 4 5
1 4 5 6
2 5 6 7
On Mon, Feb 7, 2011 at 2:17 PM, Rajiv Podar wrote:
> Printing in the normal order will print the sorted output. starting
> from Value[0][0] to value [m][n].
> OR
> Please provi
Printing in the normal order will print the sorted output. starting from
Value[0][0] to value [m][n].
OR
Please provide a e.g. array which need to be printed if I am wrong.
Thanks & Regards,
Rajiv Podar
On Mon, Feb 7, 2011 at 2:13 PM, jalaj jaiswal wrote:
> You are given a array with rows s
You are given a array with rows sorted and column sorted. You have to print
entire array in sorted order.
--
With Regards,
*Jalaj Jaiswal* (+919019947895)
Software developer, Cisco Systems
Final Year Undergraduate,
IIIT ALLAHABAD
--
You received this message because you are subscribed to the
10 matches
Mail list logo
