how to find the successor of an element in a tree ??
thank u
--~--~-~--~~~---~--~~
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
program to find the square root of a number without using sqrt is :::
#include iostream.h
#include math.h
int main()
{
const float tol = 0.05; // relative error tolerance
float value;
float oldval, newval;
cout Square root of a number
endl endl;
cout Enter a positive
Bisection and Newton raphson method are a couple of simple way to do it.You
can check up for these on any book on numerical methods.
On Mon, Feb 9, 2009 at 9:42 AM, rakesh sathu rakesh2...@gmail.com wrote:
Can anybody help me for writing code in 'c'-language to find the
square root of a
C A L LF O RP A P E R S
===
The 2009 International Conference on Frontiers in
Education: Computer Science and Computer Engineering
FECS'09
Date and Location: July 13-16, 2009,
