Do we have to partition after finding the kth element ? Will the Array not
be partitioned when the base condition is met ?
Amal.
On 3/16/07, Rajiv Mathews <[EMAIL PROTECTED]> wrote:
>
>
> On 3/16/07, Karthik Singaram L <[EMAIL PROTECTED]> wrote:
> >
> > How would the median algorithm get the top
int main()
{
int n=9,half;
char a[9][9];
if(n%2 == 0)
half = n/2;
else
half = n/2 + 1;
for(int i=0; i wrote:
> OK, I need to write an algorithm to populate a 2D array A(i,j) of size
> n x n. There is 1 '*' in the 1s
On Mar 9, 5:05 am, "infinite" <[EMAIL PROTECTED]> wrote:
> Find solutions to cormen Algorithms book in files section
that is just wonderful
thanks a lot
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algor
Yeah the average case is O(n) and worst case is O(n^2) as rightfully
pointed out. But I still feel that this would be the best solution as
the P(worst case) is quite less.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Gro
You could try :
The C++ Programming Language (3rd or Special Ed)
by, Bjarne Stroustrup
This is the fellow who developed the C++ language and this is really
an awesome book. However if you are a newbie to programming then you
might find certain difficulties with it.
--~--~-~--~~
