POSIT11:55 AM, sachin goyal
> > wrote:
>
> > > PLEASE TELL HOW
>
> > > On Sun, Sep 4, 2011 at 7:23 PM, sarath prasath
> > > wrote:
>
> > >> another sol which i learned from my friend is
> > >> think of heap sort...
>
> > &g
@sandeep Explain Algorithm/logic & Time Complexity ?
Thanks
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...
Given a word, convert it into a palindrome with minimum addition of
letters to it. letters can be added anywhere in the word. for eg if
yahoo is given result shud be yahohay.
Thanks
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to
something I Know using quick sort randomization function we can find
kt smallest/largest in unsorted array , but i am not able to write
code , please help me in this and provide the code for the same.?
Thanks
Nimish K.
1st Year
IITR
--
You received this message because you are subscribed to the
Hi, I was stuck by the follwoing interesting problem, any idea to
solve it?
100 people total, some honest and some not.
honest will always say the truth.
not hosest will sometimes lie.
and honest people is more than not-honest ones.
You can ask any people the following
question about any other
This is a brute force method. Is there any method by which we could
reduce the no. of computations , or some early checks could be made for
reducing the execution time of the algorithm.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to
Known array: a[max]; divide a[] into four sections: a[0] - a[x], a[x+1]
- a[y], a[y+1] - a[z], a[z+1] - a[max-1].
And 0http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---
