Go through the last 50-100 posts... a lot of Qs have already been
posted!!
--
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
Q1: The function below reverses a linked list in place. Call it on one
of the lists, compare the resulting list to the other list. Then call
it again to put the list back in its original order.
list Reverse(list head)
{
list T, prv, nxt;
prv = head;
for(T = head-next; T; T = nxt)
{
for written prepare for aptitude and c...and then there will be
gd...then 3-4 interviews of tech,hra...improve communication
skill for gd
On Thu, Aug 11, 2011 at 12:49 AM, Prakash D cegprak...@gmail.com wrote:
+1.. it'll be helpful
On Thu, Aug 11, 2011 at 12:12 AM,
do reply if u have it
On Thu, Aug 11, 2011 at 12:24 AM, Brijesh Upadhyay
brijeshupadhyay...@gmail.com wrote:
Yeah...please share questions..it will be of a lot help!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this
After squaring all the elements up and sorting them, couldn't we just do a
binary search on the array.. so the TC would be O(nlogn)...
On Wed, Aug 10, 2011 at 1:18 PM, Kunal Patil kp101...@gmail.com wrote:
@Ankit: Ohh Sorry..I didnt actually read the question properly..
I didnt see we have to
@Dinoja: No. You can only binary search for 1 thing, so you would have
to choose two elements and then search for the third. Thus, the order
would be O(n^2 log n).
Dave
On Aug 10, 6:11 pm, Dinoja Padmanabhan dino...@gmail.com wrote:
After squaring all the elements up and sorting them, couldn't
it also like Pythagorean theorem;
so the a[k] also with the value where
a[j]-a[i]a[k]a[i]+a[j]
and a[k]a[j]=a[i];
On 8月9日, 下午10时43分, Samba Ganapavarapu sambasiv...@gmail.com wrote:
We have an array of integers, we need to find the element a[i],a[j] and a[k]
values where.. a[i]^2 + a[k]^2 = a[k]
This is for software profile of the intern??
On Thu, Aug 11, 2011 at 1:32 AM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
for written prepare for aptitude and c...and then there will be
gd...then 3-4 interviews of tech,hra...improve communication
skill for gd
On
(sizeof(struct)); ??
That doesn't makes sense. Size of struct is what ?? you need the size of
your structure with the variables you have declared in it.
cos malloc returns pointer to memory block and nodeptr itself is a pointer
and you have used nodeptr* further?
On Tue, Aug 9, 2011 at
Consider a set of n teaks with known runtimes r1,r2,r3rn to be
run on a uni-processor machine. which processor scheduling algorithm
will result in the maximum throughput?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
shortest preemptive job first
Thank you,
Siddharam
On Thu, Aug 11, 2011 at 10:49 AM, krishna meena
krishna.meena...@gmail.comwrote:
Consider a set of n teaks with known runtimes r1,r2,r3rn to be
run on a uni-processor machine. which processor scheduling algorithm
will result in the
101 - 111 of 111 matches
Mail list logo
