Re: [algogeeks] Needed recursive sol

[geeks]

check dis out 
int fibbevensum()
{
static int a=0,b=1;
static int c,sum;
c=a+b;
if(c>1000)
return sum;
if(c%2==0)
sum=sum+c;
a=b;
b=c;
fibbevensum();}

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/D7zy55yu6ZEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: need soln

[geeks]

void reverse(char str[])
{
int i,j;
int n;
n=strlen(str);
for(i=0,j=n-1;ihttps://groups.google.com/d/msg/algogeeks/-/ahYv91mn0X0J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: BST to DLL spirally

[geeks]

just use the two stacks here and do the level order traversal in spiral 
order and keep down prev pointer each time and just maintain the doubly 
linked i think it is pretty gud hint :)

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/iHbjfHkgHl4J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: MS Question -> Median of a BST without using extra space and in O(n)

[geeks]

morris Inorder traversal can do the task i think

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/TujHItNRKowJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Array A and B

[geeks]

suppose an array A[0...n-1] given have to buld another array B[0..n-1] such 
that B[i] hold the number of lower or equal values in Right side of A[i]. in 
O(nlgn) please post solution . example if A{1,2,0,7,3} so B will be 
{1,1,0,1,0} .

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/algogeeks/-/YTQvLByiQaMJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Cormen Instructors Manual

[algoruthm geeks]

hi...
cn neone plz mail me Instructors manual of cormen 2nd edition. the
file provided in the group has been damaged. someone plz provide me
wid the manual. its urgent.

thnkx
regards
yogesh


--~--~-~--~~~---~--~~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~--~~~~--~~--~--~---