please some1 tell how to do part 2.
On Wed, Jul 20, 2011 at 6:20 PM, kavitha nk wrote:
> for 3rd v can replace decrement by an increment operator!
>
>
>
>
>
> //BE COOL// kavi
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> T
for 3rd v can replace decrement by an increment operator!
//BE COOL// kavi
--
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
yup...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 this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit th
Naveen indeed it's not infinite loop but it will print MS 2^31+1 times,
right ? :)
Change it so that it prints it 20 times.
On Wed, Jul 20, 2011 at 7:39 AM, naveen ms wrote:
> excuse me...can any explain y it goes to infinite loop..
>
> with regards
> naveen
>
> --
> You received this message be
excuse me...can any explain y it goes to infinite loop..
with regards
naveen
--
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
algo
how to solve part 2?
On Tue, Jul 19, 2011 at 4:16 PM, hary rathor wrote:
> n ; ~n
>
> --
> 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, sen
n ; ~n
--
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.
For more options, visit this group
i know 3 solns!
1) int n = 20;
int i;
for (i=0; i+n; i--)
printf("MS");
2) int n = 20;
int i;
for (i=0; i wrote:
> Given the following program, "MS" will be printed, infinite number of
> times:
> int n = 20;
> int i;
> for (i=0; i printf("MS");
>
> Apply one of the fo
Given the following program, "MS" will be printed, infinite number of
times:
int n = 20;
int i;
for (i=0; ihttp://groups.google.com/group/algogeeks?hl=en.
1. PUSH ROOT IN Q
2. PUSH DUMMY NODE IN Q, DEFINE PREVIOUS NODE AS NULL
3. WHILE Q IS NOT EMPTY
3A. POP CURRENT NODE
3B. IF CURRENT NODE IS NOT DUMMY
3B1. IF PREVIOUS, PREVIOUS->SIBLING = CURRENT.
3B2. PREVIOUS = CURRENT
3B3. PUSH CURRENT->LEFT, CURRENT->RIGHT TO Q (ONLY IF THE NODES ARE NOT
NULL)
always state one input output while asking questions sample
input-output ?
On Sat, Jul 16, 2011 at 4:16 PM, Reynald wrote:
> Given a Parent -Child binary tree ,build the child -sibling version of
> it?
> Minimize the space requirements wherever possible.
>
> --
> You received this message b
Given a Parent -Child binary tree ,build the child -sibling version of
it?
Minimize the space requirements wherever possible.
--
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
12 matches
Mail list logo
