well new group is already there so people can post job related questions,
book requests there... those who are genuinely interested in learning
algorithms will be seen in this group. :D
On Sun, Oct 9, 2011 at 10:57 AM, Sanjay Rajpal wrote:
> This will reduce the no. of people coming to post on t
This will reduce the no. of people coming to post on this group
Sanju
:)
On Sat, Oct 8, 2011 at 2:33 PM, Ankur Garg wrote:
> +1
>
>
> On Sun, Oct 9, 2011 at 2:07 AM, Sunny wrote:
>
>> Now All of the messages are being Moderated and will be posted on the
>> group only if they are found re
Recursively store parent and child pointers of the to-be-inserted tree using
post-order traversal,and when processing each node during traversal reassign
pointers to the other tree using BST insertion. Inorder may not work due to
distortion of parent pointers?
On Sun, Oct 9, 2011 at 3:38 AM, Vand
Actually, it doesn't have to be inorder. The naive approach is to traverse
through the smaller tree (using any traversal in|pre|post|level order) and
insert each node into the bigger tree. The order of this would be n2logn1
A better approach is to try and fit as much of the smaller bst into the
la
Can anyone suggest a pseudocode handling rotations in an AVL tree for
deleting a node
I couldnt find one in the internet and was unable to derive a proper logic
which cud be transformed into code :(
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" g
Inorder traversal of one tree insert into another?
On Sat, Oct 8, 2011 at 4:33 PM, Ankur Garg wrote:
> Hi ,
>
> Can anyone think of any better for doing this other than converting into
> List and then converting back again to BST ..
>
> Regards
>
> --
> You received this message because you are
+1
On Sun, Oct 9, 2011 at 2:07 AM, Sunny wrote:
> Now All of the messages are being Moderated and will be posted on the
> group only if they are found relevant, any irrelevant post be simply
> discarded without any notification till percentage of irrelevant posts
> reduces by a significant amoun
Hi ,
Can anyone think of any better for doing this other than converting into
List and then converting back again to BST ..
Regards
--
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.
Now All of the messages are being Moderated and will be posted on the
group only if they are found relevant, any irrelevant post be simply
discarded without any notification till percentage of irrelevant posts
reduces by a significant amount.
if someone is found posting too many irrelevant post, he
#include
#include
#include
#define TR(a,it)for(typeof((a).begin()) it = (a).begin(); it !=
(a).end(); ++it)
using namespace std;
void Insert(int key, int m, vector< list > &v);
list::iterator Search(int key, int m, vector< list > &v);
void Delete(int key, int m, vector< list > &v);
int
k...
thanx...your info vud be of great help for me in future..
regards,
PAYAL GUPTA,
CSE 3RD YR
NIT_B
On Wed, Sep 14, 2011 at 11:38 PM, KK wrote:
> U must mention all the boundary cases, very large input cases, -ve nos
> and must throw appropriate exception while coding during interviews...
>
This is what you use if you want *scanf()* to eat some data but you don't
want to store it anywhere; you don't give *scanf()* an argument for this
conversion
On Sun, Oct 9, 2011 at 1:32 AM, shiva@Algo wrote:
> as expected value 100 goes to a,since %*d is variable field width specifier
> so the
as expected value 100 goes to a,since %*d is variable field width specifier
so the input 200 goes for that,and the remaining input 300 goes to b
value of c is not change
so the output will be:
100 300 3
On Sun, Oct 9, 2011 at 12:22 AM, Raghav Garg wrote:
> *explain the o/p...if i/p are 100 200 3
You are welcome.
--
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/-/WJz0FGP5wUgJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscri
thnxx...4 sharing..:):)
regards,
PAYAL GUPTA,
CSE_3rd yr
NIT_B
On Sat, Oct 8, 2011 at 7:47 PM, monty 1987 <1986mo...@gmail.com> wrote:
> Thanks A lot for sharing!!
>
> On Sat, Oct 8, 2011 at 2:03 PM, Rahul Verma wrote:
>
>> Hi friends,
>>
>> Sorry for this off topic, but I found that it would b
that is 200% true... but the thing is that there are more than 8000 people
in algogeeks, and only those are active who either love learning new things
or those who want to get high paid job in some companies. Once they get jobs
they stop posting and become mute to query of others. I suggested peopl
*explain the o/p...if i/p are 100 200 300
int main()
{
int a=1,b=2,c=3;
scanf("%d %*d %d",&a,&b,&c);
printf("%d %d %d",a,b,c);
return(0);
}
*Thanking you
*With regards-
Raghav garg
Contact no. 901320194
no..i dnt knw the procedure..actually i was searching about some
companies..i have to post my query on interview-street..but look for
archieve in algogeeks..so by my personal experience i thought its gud to
have this all info in one group..procedure which i think is that the
intersted member of alg
ya, how to do it ?
how to move all discussions from one group to another if you know the
procedure then reply. :D
On Sat, Oct 8, 2011 at 10:41 PM, rahul sharma wrote:
> I have a suggestion to made...as a new group interview-street is there..but
> still a lot more info is available here in alg
I have a suggestion to made...as a new group interview-street is there..but
still a lot more info is available here in algogeeks only..so cant the owner
of group move all the info about all the companies from algogeeks to
interview-street.like pattern n ctc n etc..so that if somebody try to find
th
:)
On Sat, Oct 8, 2011 at 6:41 AM, Navneet wrote:
> I wonder why my name is there in the example string used :)
>
> On Oct 8, 3:11 pm, ManishMCS wrote:
> > A string of characters are given. Find the highest occurrence of a
> > character and display that character.
> >
> > E.g Input: AEGBCNAVNEE
Thanks A lot for sharing!!
On Sat, Oct 8, 2011 at 2:03 PM, Rahul Verma wrote:
> Hi friends,
>
> Sorry for this off topic, but I found that it would be interesting for us
> that now we have online classes of Databases from Stannford.
> db-class.org
>
> --
> You received this message because yo
1) how do u debug the code such tht u can know the compile time
error??
2) how do u judge/know exception going to arise ?? How we decide and
when??
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogee
I wonder why my name is there in the example string used :)
On Oct 8, 3:11 pm, ManishMCS wrote:
> A string of characters are given. Find the highest occurrence of a
> character and display that character.
>
> E.g Input: AEGBCNAVNEETGUPTAEDAGPE
> Output: E.
>
> Please give the efficient algorithm
k got it thnx a lot.
On Sat, Oct 8, 2011 at 4:35 PM, shady wrote:
> 1. don't use dev c
> 2. search archives
> 3. after doing 2 you will say it is not there,
> therefore solution by sunny -
>
> char five[7] -> string of length 7
> charlie -> 7 length string
>
> declare it as char[8] u will ge
1. don't use dev c
2. search archives
3. after doing 2 you will say it is not there,
therefore solution by sunny -
char five[7] -> string of length 7
charlie -> 7 length string
declare it as char[8] u will get expected output
On Sat, Oct 8, 2011 at 4:14 PM, SHIVAM AGRAWAL wrote:
> when i am ru
when i am running this on dev c it is printing times but on running in linux
it is not printing times plz any1 xplain me y is it so
#include
main()
{
char outline[50];
char one[7],two[7],four[7],five[7];
int three;
sprintf(outline,"this is %d tim %s \n",10,"cha
1.hashing performance o(n) space o(n) keep incrementing the count..by
hashing the each character
2.sort the input O(nlogn) check for succesive occurence of the
character..the most occured wud b the ans.
3.Assume the array if of int type..Let A be at index 0,B at index 1..and so
on.
now start f
A string of characters are given. Find the highest occurrence of a
character and display that character.
E.g Input: AEGBCNAVNEETGUPTAEDAGPE
Output: E.
Please give the efficient algorithm w.r.t both space and time..
--
You received this message because you are subscribed to the Google Groups
"A
Hi friends,
Sorry for this off topic, but I found that it would be interesting for us
that now we have online classes of Databases from Stannford.db-class.org
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on th
Plz put more question that has beem asked in citrix.
On 08-Oct-2011 11:33 AM, "raj kumar" wrote:
>
> * Which of the following restricts a process to the memory allocated to it
> *
> *
> *a. stack pointers
> b. memory allocation hardware
> c. kernel
> d. none of these
>
> what's the answer of this
Kernel.
On 08-Oct-2011 11:33 AM, "raj kumar" wrote:
>
> * Which of the following restricts a process to the memory allocated to it
> *
> *
> *a. stack pointers
> b. memory allocation hardware
> c. kernel
> d. none of these
>
> what's the answer of this question
>
> --
> You received this message
32 matches
Mail list logo
