.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Thanks Regards
Abhishek Gupta
BITS, Pilani
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
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.
--
Thanks Regards
Abhishek Gupta
--
You received this message because you
Guys
what is the difference between ftell(fp)1 and ftell(fp) 0??
...
Abhishek Gupta
--
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
/algogeeks?hl=en.
--
---
Regards,
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
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
.
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.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received this message because you are subscribed to the Google Groups
Algorithm
(root2-1)R/root2+1??
On Fri, Aug 19, 2011 at 8:03 PM, Greeshma greeshma.0...@gmail.com wrote:
is it (root 2 - 1) * R ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
search the group
--
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/-/-uBb8iSPXTQJ.
To post to this group, send email to algogeeks@googlegroups.com.
To
@aditi: like..
--
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/-/QT0UrDjFSoEJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
earlier it has been posted in the group that check the size of pointer
variable,
if it is 2b then 16 bit
4b then 32 bit
8b then 64 bit
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
Q2). i think for second question it will be enough to just swap the data of
current node to next node,
and delete the next node.
it will be like,
//for swap
int temp=current-data;
current-data=current-next-data;
current-next-data=temp;
//for delete
struct node *temp;
temp=current-next;
Regards
Abhishek Gupta
BITS, Pilani
--
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
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.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received
Answer 2) To prevent use of NULL with any other variable instead of 0(zero),
it is set at void pointer.
for ex, you cannot use in C like this, a=b+NULL;
but, i think, in C++ you can do.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view
binary values are stored in reverse order of byte by byte.
in your case, bytes will be stored as,
10101100 0100
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
In a linkedlist we have lost the head pointer and currently we are in the
middle(anywhere) of list.
Is it possible to delete the previous node of the current pointer.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on
okay..
--
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/-/6Diby2oBmy4J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
actually someone has asked me. he is saying that it is possible and the
funny thing is that he also doesn't know the solution..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
Errata:
sorry guys..
there is a change in the problem.. actually we have to INSERT a NEW NODE
before the current pointer.
Now tell is it possible..
or again it is a stupid question..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view
let the array be A={ 3,5,7,10} then it should give output as 13 (3+10)
In short, we need to find the possible maximum sum such that no 2 elements
in the subarray has 2 elements adjacent. there is no bound on the size of
subarray.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received
duplicates or using hash tables??
Q2- Same qn is like all except one are repeated off no. of times and one
element repeated even no. of times. find that element. (no specification for
X-OR use given)
Ans- Again, I tried it using hash table.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You
/algogeeks?hl=en.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
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
@Prakash
can you post your solution please
On Mon, Aug 1, 2011 at 1:39 PM, Abhishek Gupta gupta.abh...@gmail.comwrote:
@Kartik
we cant choose adjacent elements. for ex A={5,2,1,7,9,11} then we will have
5+7+11
can any one give any algo for this
thank you
On Mon, Aug 1, 2011 at 1:25 PM
: A= {5,d,1,r,4,a};
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
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
.
On Mon, Aug 1, 2011 at 1:39 PM, Abhishek Gupta gupta.abh...@gmail.comwrote:
@Prakash
can you post your solution please
On Mon, Aug 1, 2011 at 1:39 PM, Abhishek Gupta gupta.abh...@gmail.comwrote:
@Kartik
we cant choose adjacent elements. for ex A={5,2,1,7,9,11} then we will
have 5+7+11
from top to bottom and another through bottom to top..
ex : top1=0, top2=n-1 where n is size of stack.
and use top1 to insert elements to index 0..1..2...
and top2 to insert elements to index n-1..n-2..n-3
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received this message because you
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.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received this message because you
exclude maxElement,
(maxElement+1) and (maxElement-1) in the comparision ) save this position to
secondElementRequired variable
This takes O ( n )
return array[ maxElement ] + array [secondElementRequired ]
Thank you,
Samba
On Mon, Aug 1, 2011 at 5:31 AM, Abhishek Gupta gupta.abh
max possible sum of 2 elements excluding adjacent
ones.. sorry guys.
On Mon, Aug 1, 2011 at 8:54 AM, Abhishek Gupta gupta.abh...@gmail.comwrote:
@samba
i think you didnt get the question.
On Mon, Aug 1, 2011 at 5:56 PM, Samba Ganapavarapu sambasiv...@gmail.com
wrote:
Step 1
Find
is like all except one are repeated off no. of times and one
element repeated even no. of times. find that element. (no specification for
X-OR use given)
Ans- Again, I tried it using hash table.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
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.
--
Abhishek Gupta
@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.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received this message because you are subscribed
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
..?
On 7/31/11, Abhishek Gupta gupta.abh...@gmail.com wrote:
compiler : gcc, OS : Fedora 15
I use ctrl + d to put EOF in files.
you can verify it through this code
#includestdio.h
int main(int argc,char *argv[])
{int c;
while((c=getchar())!=EOF
:
the operation is nt extract min ... its *find* min ...
On Sun, Jul 31, 2011 at 3:02 PM, Abhishek Gupta gupta.abh...@gmail.comwrote:
@shubham maheshawari
deletion can't be performed in O(1).
after extracting the min element, we need to find the next minimum
element, and worst case will take O(n) time
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.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received
://groups.google.com/group/algogeeks?hl=en.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
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
.
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.
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
You received this message because you are subscribed to the Google Groups
Algorithm
?
--
Abhishek Gupta
MCA
NIT Calicut
Kerela
--
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
38 matches
Mail list logo
