Re: [algogeeks]
here we just undefining wat we defined rite then wat is the use of ifdef undef..we can directly use as #define getchar ...na !! -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] C - pre & post increment
no it is legal only... its working
On 7/21/11, Reynald Suz wrote:
> I tried in Dev C++,code-B executes infinitely. Why?
>
> On Thu, Jul 21, 2011 at 4:13 PM, Gaurav Popli wrote:
>
>> dont you think it is illegal using x=x-- or x=--x;??
>>
>> On Thu, Jul 21, 2011 at 2:56 PM, karthiga m
>> wrote:
>> > in code A using pr e- decrement therefore i gets decremented when
>> > checking while condition so
>> > it will print as 9 8 7 6 5 4 3 2 1 .
>> > in code B using post-decrement it will prints like 9 8 7 6 5 4 3 2 1 0
>> > here why zero printing means while checking while condition x-- have
>> > previous value..therefore at tht time x-- is 1 so while condition
>> > executing and prints x value as zero.
>> >
>> > On 7/21/11, Reynald wrote:
>> >> Code: A
>> >> int main()
>> >> {
>> >> int x = 10;
>> >> while ( x = --x)
>> >> printf( " %d ", x);
>> >> getchar();
>> >> }
>> >>
>> >> Code: B
>> >> int main()
>> >> {
>> >> int x = 10;
>> >> while ( x = x--)
>> >> printf( " %d ", x);
>> >> getchar();
>> >> }
>> >>
>> >> Does Code-A and Code-B work similar? Justify.
>> >>
>> >> --
>> >> 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 at
>> >> http://groups.google.com/group/algogeeks?hl=en.
>> >>
>> >>
>> >
>> > --
>> > 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 at
>> http://groups.google.com/group/algogeeks?hl=en.
>> >
>> >
>>
>> --
>> 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 at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>
>
> --
> Regards
> Reynald Reni
> Masters in Software Engineering
> CIT - India
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
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 at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] C - pre & post increment
in code A using pr e- decrement therefore i gets decremented when
checking while condition so
it will print as 9 8 7 6 5 4 3 2 1 .
in code B using post-decrement it will prints like 9 8 7 6 5 4 3 2 1 0
here why zero printing means while checking while condition x-- have
previous value..therefore at tht time x-- is 1 so while condition
executing and prints x value as zero.
On 7/21/11, Reynald wrote:
> Code: A
> int main()
> {
> int x = 10;
> while ( x = --x)
> printf( " %d ", x);
> getchar();
> }
>
> Code: B
> int main()
> {
> int x = 10;
> while ( x = x--)
> printf( " %d ", x);
> getchar();
> }
>
> Does Code-A and Code-B work similar? Justify.
>
> --
> 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 at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
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 at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Shooters in a circle
i got this solution .. assuming when n=1 1st person will be alive when n=21st person will be alive , when n=3 3rd person will be alive when n=4 1st person will be alive when n=5 3rd one will be alive when n=6 5th person will be alive when n=7 7th one wil be alive when n=8 1st person will be alive ..when n=16 1st person will be live when n=32 1st person will be alive..by this we can conclude that for n=1,2,4,8,16,32,64 the 1st person will not die... between this the odd one's will not die.. the sequence will be like between n=2 and n=4 ..3rd one will not die, same as between n=4 and n=8 3rd,5th,7th one will not die... so by filling odd no's between the values for what we getting one we can find the person who will be alive. hence for 2 POWER n the 1st person will be alive if anything wrong in this pls correct me..!!! On 7/21/11, SAMM wrote: > I think it is related to Joshepus problm... ckeck wikipedia for more > info. > > On 7/20/11, Vivek Srivastava wrote: >> If n people are standing in a circle ,they start shooting the person >> standing next to their neighbour.If they start firing in this way , >> determine who will be alive after this sequence?? >> >> -- >> 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 at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Somnath Singh > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Shooters in a circle
take an assumption,if an one ppl s there he never die eg : no.of ppl person who will not die 11 2 1 3 2 4 4 5 1 6 On 7/21/11, SAMM wrote: > I think it is related to Joshepus problm... ckeck wikipedia for more > info. > > On 7/20/11, Vivek Srivastava wrote: >> If n people are standing in a circle ,they start shooting the person >> standing next to their neighbour.If they start firing in this way , >> determine who will be alive after this sequence?? >> >> -- >> 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 at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Somnath Singh > > -- > 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 at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Microsoft Qn: Algo to find the border of a binary tree
thanks ... i got it :) -- 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 at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Microsoft Qn: Algo to find the border of a binary tree
can anyone pls tell me how to print 2D array in spiral manner?/
On 7/17/11, prasanth n wrote:
> @sagar pareek:
> thanks
>
> On Sun, Jul 17, 2011 at 6:50 PM, sagar pareek wrote:
>
>> yeah it can be
>>
>> On Sun, Jul 17, 2011 at 6:47 PM, prasanth n wrote:
>>
>>> @sagar pareek:
>>> we cant use linked list ah??
>>>
>>>
>>> On Sun, Jul 17, 2011 at 6:44 PM, sagar pareek
>>> wrote:
>>>
kk...
On Sun, Jul 17, 2011 at 5:31 PM, sourabh jakhar >>> > wrote:
> @sagar pareek
> if you are from mnnit than donot disclose these kind of things here .
>
>
> On Sun, Jul 17, 2011 at 5:28 PM, sagar pareek
> wrote:
>
>> @prasanth
>> Trie will be used... :) :)
>>
>>
>> On Sun, Jul 17, 2011 at 5:28 PM, sagar pareek
>> wrote:
>>
>>> @saurabh
>>> Ok...
>>> on 20th amazon is coming :)
>>>
>>>
>>> On Sun, Jul 17, 2011 at 4:35 PM, prasanth n
>>> wrote:
>>>
@sourabh jakhar:
how to design that big int class?? what data structure to use??
On Sun, Jul 17, 2011 at 3:55 PM, sourabh jakhar <
sourabhjak...@gmail.com> wrote:
> i donot know abt the results but one thing for sure get your basic
> first right and than do the weird question
>
>
> On Sun, Jul 17, 2011 at 3:53 PM, sagar pareek <
> sagarpar...@gmail.com> wrote:
>
>> Yeah best of luck saurabh
>> whaen results will be out?
>>
>> On Sun, Jul 17, 2011 at 3:47 PM, sourabh jakhar <
>> sourabhjak...@gmail.com> wrote:
>>
>>> hey today ms visited our campus they asked simple 10 c output in
>>> first round and than 45 minutes coding round one question on test
>>> case on
>>> notepad,design bigint class,one simple question on array.
>>>
>>>
>>> On Sun, Jul 17, 2011 at 3:42 PM, sagar pareek <
>>> sagarpar...@gmail.com> wrote:
>>>
@reynaled :- Happy to help
@Sameer :- Thanks for pointing out and i think all you guyz now
can optimize it :)
On Sun, Jul 17, 2011 at 11:35 AM, sameer.mut...@gmail.com <
sameer.mut...@gmail.com> wrote:
> @sagar: The question says Algo should be in place. So use of an
> array to print the right border of tree is not advisable. We
> can do it
> recursively without using an array also .
>
>
> On Sat, Jul 16, 2011 at 10:48 PM, sameer.mut...@gmail.com <
> sameer.mut...@gmail.com> wrote:
>
>> @sagar: There is one flaw in the code. Trace ur code 15 and
>> 250
>> get printed twice. otherwise it is fine.
>>
>>
>> On Sat, Jul 16, 2011 at 7:59 PM, sukhmeet singh <
>> sukhmeet2...@gmail.com> wrote:
>>
>>> please explain the code a bit more.. unable to understand
>>> it..an example will be better..
>>>
>>>
>>> On Sun, Jul 17, 2011 at 7:10 AM, Reynald Suz <
>>> reynaldsus...@gmail.com> wrote:
>>>
Yep!
On Sun, Jul 17, 2011 at 1:02 AM, swetha rahul <
swetharahu...@gmail.com> wrote:
> @Reynald
> Will 75 not be included in the
> tree that u have given..??
>
>
> On Sun, Jul 17, 2011 at 12:49 AM, sagar pareek <
> sagarpar...@gmail.com> wrote:
>
>> here is the code
>> void border(node*);
>> void recur(node*);
>>
>> void border(node *ptr)
>> {
>> node* tmp; int stack[20],top=0;
>> if(tmp=ptr->left)
>> {
>> while(tmp->left)
>> {
>>printf("%d ",tmp->data);
>>tmp=tmp->left;
>> }
>> }
>> recur(ptr);
>> if(tmp=ptr->right)
>> {
>> while(tmp->right)
>> {
>>stack[top++]=tmp->data;
>>tmp=tmp->right;
>> }
>> }
>> while(top--) printf("%d ",stack[top]);
>> printf("%d\n",ptr->data);
>> }
>>
>> void recur(node* ptr)
>> {
>> if(ptr->left) recur(ptr->left);
>> if(!ptr->left&&!ptr->right) printf("%d ",ptr->data);
>> if(ptr->right) recur(ptr->right);
>>
