/algogeeks?hl=en.
--
Regards
Amit Mittal
--
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...@googlegroups.com
plz send me that book too
On Mon, Sep 26, 2011 at 3:28 PM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
plz send me that book to
I also need that book...
On Sun, Sep 25, 2011 at 9:37 PM, sarath prasath
prasathsar...@gmail.comwrote:
hi every one..
pls do give me the link
double sqrt(double c)
{
if (c 0) return error;
double err = 1e-15;
double t = c;
while (fabs(t*t - c) err)
t = (c/t + t) / 2.0;
return t;
}
On Sun, Sep 25, 2011 at 2:57 PM, teja bala pawanjalsa.t...@gmail.comwrote:
@vikram
the one which i posted(link) it was newton raphson method which
Please upload this book, if anyone of you have it.
On Fri, Aug 19, 2011 at 7:59 AM, Swati Sarraf swati1...@gmail.com wrote:
Hey Navneet , which book are you talking abt- Data structure and algo made
easy OR Data structure Puzzles ?
Rahul,
This is not the complete book, it has just two chapters. Can you provide a
link for the entire book ?
On Sat, Sep 3, 2011 at 6:28 PM, Rahul Verma rahulverma@gmail.comwrote:
download the book from:
This might help
http://publib.boulder.ibm.com/infocenter/comphelp/v8v101/index.jsp?topic=%2Fcom.ibm.xlcpp8a.doc%2Flanguage%2Fref%2Fcplr130.htm
\
On Mon, Aug 22, 2011 at 11:40 AM, Sanjay Rajpal srn...@gmail.com wrote:
Here concept of v-tables comes into picture. Refer to C++ Primer Plus by
I have my google interview at the end of this month.
can any body provide me some tips/suggestions/questions ?
I am sure some of you guys here must have appeared in google interviews
before,
your help will be very valuable and much appreciated.
Thanks
--
You received this message because you
first player can check if sum of notes placed in the odd position are
greater than the sum of notes placed in the even position and can pick
accordingly and will always win.
On Sat, Oct 9, 2010 at 10:52 AM, Anand anandut2...@gmail.com wrote:
Yes.
http://codepad.org/2KFrv8cs
On Fri, Oct 8,
yes...all smart pointers does that.
On Fri, Jul 23, 2010 at 5:41 PM, Tech Id tech.login@gmail.com wrote:
Is it possible to overload the operator * used to dereference
pointers?
Can you give a practical example of the same?
--
You received this message because you are subscribed to the
cost = min (E(i-1, j ) ,E(i , j-i) , E(i-1,j-1) + diff(i,j))
where diff(i,j) = 0 if( a[i] == b[j])
= 1 otherwise
and E(0, i) = i and E(j,0) = j
On Tue, Jul 20, 2010 at 2:10 PM, Ashutosh Shukla 04aashut...@gmail.comwrote:
try it by longest common sequence.
then
Vikas,
Consider the following case
2 5 16 17 20 25;
Neither two max nor two min will give the minimum difference.
On Tue, Jul 13, 2010 at 9:52 AM, vikas kumar vikas.kumar...@gmail.comwrote:
I did not get your point.
for 2 6 3 7
min 2
sec min 3
difference is 1
answer is 2 and 3
what more
I think this will work.
# include stdio.h
void my_print(int *,int);
void swap(int a , intb)
{
a = a + b;
b = a - b;
a = a - b;
}
void sort(int* array, int SIZE, int i, int j)
{
while(ij)
{
my_print(array,SIZE);
if(array[i] = array[j])
this is same as finding palindrome in a given linked list..
it may help
http://geeksforgeeks.org/?p=1072
On Wed, Jun 23, 2010 at 6:00 PM, divya jain sweetdivya@gmail.comwrote:
if we dont want to change original list..
is there ny efficient method for that?
On 23 June 2010 06:49, ANUJ
13 matches
Mail list logo
