Re: [algogeeks] Re: do this: two numbers with min diff

2010-09-21 Thread LG JAYARAM .
Guyswe need to find two numbers in a array with minimum difference ah On Tue, Sep 21, 2010 at 8:52 PM, Rahul Singal rahulsinga...@gmail.comwrote: try running it on [ 11 , 6 , 100, 101] -- You received this message because you are subscribed to the Google Groups Algorithm Geeks

Re: [algogeeks] Re: print largest continue subsequent in int array

2010-09-21 Thread LG JAYARAM .
Guys!! On Mon, Sep 20, 2010 at 7:08 PM, LG JAYARAM . lgj...@gmail.com wrote: @Krunal: can u explain hwz 7 On Mon, Sep 20, 2010 at 6:02 PM, Krunal Modi krunalam...@gmail.comwrote: @LG JAYARAM: It is 7. -- You received this message because you are subscribed to the Google Groups

Re: [algogeeks] Re: print largest continue subsequent in int array

2010-09-20 Thread LG JAYARAM .
krunalam...@gmail.com wrote: @LG Jayaram : check for -5 -4 -3 -2 -1 answer should be : -1 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group

Re: [algogeeks] recursion to remove duplicate characters in a string

2010-09-20 Thread LG JAYARAM .
:31 PM, LG JAYARAM . lgj...@gmail.com wrote: hi buddy ...Im clear with the ideahereby I share the concept... wat exactly need to be done to solve this task isbetter create a Binary search tree...the Binary search tree will not allow duplicates and If u perform a inorder traversalu

Re: [algogeeks] Re: print largest continue subsequent in int array

2010-09-20 Thread LG JAYARAM .
@Krunal: can u explain hwz 7 On Mon, Sep 20, 2010 at 6:02 PM, Krunal Modi krunalam...@gmail.com wrote: @LG JAYARAM: It is 7. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com

Re: [algogeeks] Re: print largest continue subsequent in int array

2010-09-19 Thread LG JAYARAM .
]+a[loop1+1]); loop2=0; break; } } if(loop2!=0) { printf(NO SUCH ENTRIES FOUND); } getch(); } On Sun, Sep 19, 2010 at 11:57 AM, Krunal Modi krunalam...@gmail.com wrote: @LG JAYARAM : Your code is not even compiling. If you are including header that means you have made a code

Re: [algogeeks] recursion to remove duplicate characters in a string

2010-09-19 Thread LG JAYARAM .
hi buddy ...Im clear with the ideahereby I share the concept... wat exactly need to be done to solve this task isbetter create a Binary search tree...the Binary search tree will not allow duplicates and If u perform a inorder traversalu can get the result...the task is oversimple

Re: [algogeeks] Re: print largest continue subsequent in int array

2010-09-19 Thread LG JAYARAM .
How could it be -1,in the given array -1 and -2 are the largest numbersso their sum will be -3 rite On Sun, Sep 19, 2010 at 4:15 PM, Krunal Modi krunalam...@gmail.com wrote: @LG Jayaram : check for -5 -4 -3 -2 -1 answer should be : -1 -- You received this message because you

Re: [algogeeks] print largest continue subsequent in int array

2010-09-18 Thread LG JAYARAM .
#includestdio.h void main() { int array[20],loop1,loop2,temp; // INITIALIZATION printf(ENTER THE ARRAY SIZE); scanf(%d,num); for(loop1=0;loop1num;loop1++) { scanf(%d,a[loop1]); } for(loop1=0;loop1num;loop1++) { for(loop2=0;loop2num;loop2++) // SORTING { if(a[loop1]a[loop2]) { temp=a[loop1];