A 2D array of order A[N][N] is given, considering entry A[i][i] as invalid
you have to select one element from each row such that
1. Selected elements does not belong to same column.
2. Sum of selected element has maximal.
--
Thanks and Regards:
Rahul Kumar
pivot position plays important role in determining the time complexity of
the algorithm.
suppose array is already sorted then if you go by obvious means by
selecting pivot element as the 1st element of the input array,then
recurrence will be :-
T(n)=T(n-1)+theta(n)
hence complexity of the algo
typo error :-
we can make it *independent** of this input format
On Sat, Sep 15, 2012 at 11:56 PM, atul anand atul.87fri...@gmail.comwrote:
pivot position plays important role in determining the time complexity of
the algorithm.
suppose array is already sorted then if you go by obvious means
correct me if i am wrong ,
it seems similar to Hungarian algorithm.
here each column can be considered as persons P(p0,p1,p2,..pn) and each as
cost of job say X(x0,x1,x2,x3,x4xn).
Hungarian algorithm tells how to find minimal but here its maximal...so i
guess changes in the algo will give the
typo error :-
and each *row* *as cost
On Sun, Sep 16, 2012 at 12:44 AM, atul anand atul.87fri...@gmail.comwrote:
correct me if i am wrong ,
it seems similar to Hungarian algorithm.
here each column can be considered as persons P(p0,p1,p2,..pn) and each as
cost of job say
some one with infibeam visited their college please tell their proceure and
also give some questions asked in written and interviews .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
@atul
agreed with u dat it can be solved through hungarian method.. but what
about the condition a[i][i] entry is invalid
if all elements lie on diagonal n d sum is also maximum den a[i][i]
condition will be violated but Hungarian method still works
--
You received this message because you are
