If we don't process the same number more than once, does it not create a
situation when we miss out on the solution?
For example the digit 6 in this sequence:
1,2,3,4,0,2,3,1,4,5,2,4,3,4,5,6,7,8,9
Varun
Varun Sachdeva
On 28 January 2014 00:29, Don wrote:
> This works, and I thin
I think you should go to Edulix.com. There you can find details about the
expenses for MS in a many different US universities
On Tue, Jun 25, 2013 at 4:54 PM, Shachin Sharma wrote:
> Most of the good/top universities will have many TA and RA positions.
> Besides this University associated insti
Prepare to spend atleast 20 Lakhs
On Tue, Jun 25, 2013 at 4:49 PM, Jagannath Prasad Das
wrote:
> Folks,
>I suppose this is not the right blog to query about the aforementioned
> subject, but i am of opinion that i can get a comprehensive reply to my
> question. On an average how much money(a
Hello all,
I have this problem to solve, and seek your assistance.
Program should be feeded with following integer inputs.
1. n integers in ascending order (a1,a2,a3...an)
2 an integer K.
We need to find K(k1,k2...kn) integers between [a1..an] both inclusive
such that the sum of the absolute va
ons can be answered.
Hope I'm cleared.
Thanks & Regards,
Varun
On Tue, Jan 29, 2013 at 12:25 AM, nikhil rao wrote:
> Dream teams are formed by television viewers by selecting five players
> from the sixteen players namely
> F1,F2,F3,F4,F5,F6,F7,F8,F9,F10,F11,F12,F13,F14
see, ideally for Q1, the answer the NO.
But paging has some advantage, therefore its better to have it neverthless
Q2, ??
--
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/m
For datastructure round, do practice simple datastructure questions
generally asked in microsoft interviews.
Varun Singh
9958130047
On Sat, Sep 8, 2012 at 11:13 AM, sandeep kumar
wrote:
> Hey!!!
> Can anyone give some idea about Accolite technologies placement procedure
> and question
>
> This one's clever!
--
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/-/DVlEUy17gMgJ.
To post to this group, send email to algogeeks@googlegroups.com.
To un
>
> Circular Queue, as it will overwrite in that case.
I am not sure, if I understood the question correctly though.
--
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/ms
That's agreed Gene.
Answer depends on context.
On Saturday, 19 May 2012 22:46:06 UTC+5:30, Gene wrote:
>
> This question has no answer. Every good student of computer science
> will know that you choose a data structure based on the _operations_
> that must be performed on it: insert, lookup and
should be a tree based on domain in url and directory mentioned in url.
On Tuesday, 15 May 2012 21:20:55 UTC+5:30, atul007 wrote:
>
> Given a file which contain millions of URL's. which data structure would
> you use for storing these URL's . data structure used should store and
> fetch data in
what's q then? can you please give few more examples?
On Thursday, 19 April 2012 23:02:31 UTC+5:30, tech coder wrote:
>
> determine whether the given string is of form pZq.
> p and q can contain only X and Y.
> like if p=XXYX then z will be XYXX
> for ex XXYXXXYXX is valid
>
> the limitation is
use double hash
On Friday, 6 April 2012 22:50:14 UTC+5:30, Rose wrote:
>
> Thanks all of you. I'm new to algorithms and data structure and I'm new in
> this forum.
> I have an assignment but not sure yet:
>
> A. Describe a data structure which can effectively answer the following
> questions:
>
Sorry for lot of typos
On Mon, Apr 9, 2012 at 1:53 PM, Varun Nagpal wrote:
> GP programming on GPU is useful for those algorithms which are
> computationally intensive, can be paralleled with least overheads,
> granularity of per thread computations is not big, less+similar control
&
dware options and its
architecture.
One of the criteria of how to choose would be see the calculations/per
memory access. The higher is this value, the better it would be suitable
for GPU than CPU and vice versa
I suggest you to this question on a computer architecture forum.
Thanks
Varun
On Mon,
use RPC or RMI.
Since java use RPC
On Friday, 23 March 2012 10:07:12 UTC+5:30, Aman Kumar wrote:
>
> Hii to all
>
> how to make a call of class's method(function) from client side to
> server in java?
>
> please replyit's urgent
--
You received this message because you are subscribed to t
Yes, if they meet then its a loop, but in later case, they won't meet
in case where loop has anything more than 1 element.
here one ptr is at meeting point, and second is at start of loop, but
the distance between them isn't always one, its the number of elements
in the loop.
Now when u move each b
cool
On Tue, Feb 28, 2012 at 9:22 PM, Ravi Ranjan wrote:
> hey Geeks thanx a lot .. for the valuable information in the
> discussions
>
> i got selected in Yatra.com (R n D profile)
>
> thanx a lot for the algorithms explained by to guys
>
> THANX A LOT
>
> :D:D:D:D
>
>
> --
> You receive
Yep..that's correct.
In this context, I would like to understand a little more about inline
functions?
Other than they being a type sensitive compared to macro, what else differs
them from macro, and does each call to inline function, does get replaced
by its definition!.
Any link, that can giv
I was asked this question sometime during an interview.
WE have an array of known length. The elements in array can be repetitive.
now sort the array based on frequency of occurrence of each element in
array.
Eg: a= {4.3.2.5.4.6.2.6}
after sorting a={4,4,2,2,6,6,3,5}
4,2,6 all occurs twice, in t
Ideally it should be invested intellectually to reap fruits for
future.
Invest in RnD for upcoming technologies like wireless, video, roaming,
seamless integration of devices, achieving standards for protocols
which are heavily used but not standardized.
On Feb 1, 5:53 am, Ashish Goel wrote:
> Hi
ived 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
Thats right. Clock speed is governed by slowest processing stage + register
delay. With clock cycle of (160+5) ns even the faster stages will be forced
to run slowly. As a result 1st instruction will take 165*4 ns and rest of
following 999 instructions will take 165*999 ns.
On Tue, Sep 27, 2011 a
Dude google C++ Faqs. You will find all your answers. You can also buy some
books
1. C++ Common Knowledge: Essential Intermediate Programming
2. Effective and More effective C++
3. C++ gotchas
On Sat, Sep 24, 2011 at 11:52 AM, Decipher wrote:
> Q1) What does the compiler does if I declare a bas
ext = newNode
return startNode
}
}
}
}
}
*END Function*
*You can look at below email for more explanation of unrolled linked list.*
*
*
*
*
*Thanks *
*V.*
*
*
*
*
On Thu, Jul 28, 2011 at 6:43 PM, Varun Nagpal wrote:
> Thanks a lot for your inputs Sunny. Your solution seems corr
d email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Varun Jakhoria
...it's only about 0's & 1's
--
You received this message because you are subscribed to the G
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.
>>>
>>>
>
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.
>
>
--
Varun Jakhoria
...it
mail 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.
>
--
Varun Jakhoria
...it's only about 0's & 1's
--
ups.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.
>
--
Varun Jakhoria
...it's only about 0's & 1's
--
You received this mess
roup/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> Regards,
>> Kamakshi
>> kamakshi...@gmail.com
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To pos
hm 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.
>
>
--
Varu
use 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
>
ks@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.
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad
@ambika :: assuming only pointer can move in forward direction.
On Thu, Jul 28, 2011 at 11:26 PM, varun pahwa wrote:
> @amit:: I think ur solution will give wrong answer if all the characters
> are not unique.
>
> On Thu, Jul 28, 2011 at 11:13 PM, SAMMM wrote:
>
>>
>&
.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad.
Ph : 09793899112
Official Email :: rit2008...@iiita.ac.in
Another Email :: varunpahwa.ii.
avoidance ? Do I perform binary search on each node
during the list construction to check for duplicates? Or you can think of a
more efficient way?
Thanks a lot
Varun
On Thu, Jul 28, 2011 at 11:02 AM, sunny agrawal wrote:
> Nice Problem :)
>
> i think taking care of duplicates is ve
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
roup/algogeeks?hl=en.
>>
>
>
>
> --
> Regards
> Rajeev N B <http://www.opensourcemania.co.cc>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to alg
N B <http://www.opensourcemania.co.cc>
>
>
> --
> 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
LLAHABAD
>
>
>
> --
> 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...
glegroups.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.
>>>>>
>>
this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Regards,
> Kamakshi
> kamakshi...@gmail.com
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
&
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.
>
--
Varun
uot;
> > > > *- Hide quoted text -
> >
> > > > - Show quoted text -
> >
> > > --
> > > You received this message because you are subscribed to the Google
> Groups
> > > "Algorithm Geeks" group.
> > > To post to this g
le 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/gro
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.
>>
>>
>
>
> --
> **Reg
gt; 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.
>&
--
> 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 mo
sorry that would not work. only it could work if each element is present
exactly once.
On Mon, Jul 18, 2011 at 5:44 PM, Aakash Johari wrote:
> Yes, you will have to write a quad eq. solver. It's easy to write.
>
>
> On Mon, Jul 18, 2011 at 5:13 AM, Aakash Johari wrote:
>
>
send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad.
Ph : 09793899112
Official Email :: rit2008..
s group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad.
Ph : 09793899112
Official Email :: rit2008...@iiita.ac.in
Another Email :: varunpahwa.ii...@gmail.com
People who fail to plan are th
oup, 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.
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Instit
ignore my previous result.
the ans to first should be 2 22 2 0.
and the ans to second should be.
2 222
2
please correct me if i am wrong.
On Sat, Jul 16, 2011 at 5:38 PM, varun pahwa wrote:
> the ans to first should be 2 2 2 2 0.
> and the and to second should be.
> 222 2
> 2
>
please ignore my previous post.
On Sat, Jul 16, 2011 at 5:38 PM, varun pahwa wrote:
> the ans to first should be 2 2 2 2 0.
> and the and to second should be.
> 222 2
> 2
> please correct me if i am wrong.
>
> On Sat, Jul 16, 2011 at 4:57 PM, shady wrote:
>
>> @ank
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 unsubsc
om this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad.
Ph : 09793899112
Official Email :: rit20
ps.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 t
>>
>>
>>
> --
> Regards:
> ---
> D Kranthi kumar
> Computer Science & Engg.
> 1st Mtech, IIT Madras.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To p
ant in it ?anyone link regarding that ??
>
> --
> 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
> algogeek
;
> --
> 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.
>
p, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad.
Ph : 09793899112
Official Email :: rit20
Can someone give me coding implementation of spaghetti sort in java or
c/c++. I know the steps but i wonder how it can be implemented.
http://en.wikipedia.org/wiki/Spaghetti_sort
--
Warm Regards,
Varun Kumar
Email Id: varun.gt...@gmail.com
Contact: +91-9711751235
--
You received this message
Mittal
>> 4th year , Computer Engineering
>> Student-Coordinator , DTU WebTeam
>> Delhi Technological University
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this
@sunny thnx for the correction.
On Sat, Jul 2, 2011 at 9:16 AM, varun pahwa wrote:
> @sunny ya i wanted to write the while(k % m == 0)
>
>
> On Sat, Jul 2, 2011 at 3:47 AM, sameer.mut...@gmail.com <
> sameer.mut...@gmail.com> wrote:
>
>> n&n-1 is the expressio
logy,Roorkee
>>
>> --
>> 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+u
subscr...@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 g
gt;> 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.
>>
>
>
&
I don't have any alternative solution till now.
On Wed, Jun 29, 2011 at 8:05 PM, varun pahwa wrote:
> @ankit: ur space complexity will be too high. i think it will be ultimately
> 2^n where n is the number of the nodes.
>
> On Wed, Jun 29, 2011 at 1:10 PM, ankit sambyal wrote:
gt;>
> >
> > --
> > 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
> >
oglegroups.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,
isit this group at
>>> > >http://groups.google.com/group/algogeeks?hl=en.
>>> >
>>> > --
>>> > Sunny Aggrawal
>>> > B-Tech IV year,CSI
>>> > Indian Institute Of Technology,Roorkee- Hide quoted text -
>>> >
>>>
roups
> "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.
&
t; http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Technology Allahabad.
Ph : 09793899112 ,08011820777
Official Email :: rit2008...@iiita.ac.in
Another Email :: varunpahwa.ii...@gmail.com
People who fail to plan are those who p
= 2 T(n/2) + O(1) :: O(nlogn)
>
>
>
>
> On Sat, Jun 25, 2011 at 12:15 PM, varun pahwa wrote:
>
>> will this work.
>> n size of array.
>> cal (a[i] - min(arr) + 1).
>> now cal sum of a[i], cal square sum of array as (a[i] * a[i]) , cal cube
>> sum
, 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
> >> >
il 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.
>
>
--
Varun Pahwa
B.Tech (IT)
7th Sem.
Indian Institute of Information Tec
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
lgogeeks@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.
>
--
Warm Regards,
Varun Kumar
Email Id: varun.gt...@gmail.com
Contact: +91
t. Ltd
>>
>> --
>> 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
>> algo
;
>>>> >> --
>>>> >> Piyush Sinha
>>>> >> IIIT, Allahabad
>>>> >> +91-8792136657
>>>> >> +91-7483122727
>>>> >> https://www.facebook.com/profile.php?id=10655377926
>>>> >>
send email to
>>> >>>>>> > algogeeks+unsubscr...@googlegroups.com.
>>> >>>>>> > For more options, visit this group at
>>> >>>>>> > http://groups.google.com/group/algogeeks?hl=en.
>>> >>>>>
tp://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 algo
can anyone explain "Since there
are less than 2^32 numbers in the file there is bound to be one number
in the array that is less than 2^16." in dumanshu's solution.
On Fri, Jun 10, 2011 at 12:39 PM, varun pahwa wrote:
> @ankit :please explain by taking an example.
>
>
&
o 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.
>> >
>>
e 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/algo
*
> *
>
> --
> 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...@google
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
>>>
Maybe this problem is related to pigeon hole problem
On Mon, May 30, 2011 at 8:44 AM, Aakash Johari wrote:
> No, won't work. :(
>
>
> On Sun, May 29, 2011 at 11:39 PM, Aakash Johari wrote:
>
>> Can this solution work?
>>
>> Create adjacency matrix where adj[i][j] representing person i doesnt like
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
>
Please refrain from sharing such links and engaging in piracy.
I kindly request the admin of this forum to delete all such posts and to
warn the users on the forum for possible barring in case they are found to
use this forum for piracy and malpractices.
On Sat, Apr 30, 2011 at 12:09 PM, Charles
I think these questions are stupid in the sense that no one would ever use
these constructs in their production code unless someone wants to write an
obscure obfuscated code in some competition. Many times similar expressions
are non-portable.
Anyways, to understand this and related concepts, plea
I do know about event based simulation in digital circuit simulators..
It would be interesting to know.what exactly algorithms they use
On Fri, Mar 4, 2011 at 5:27 PM, Luciano Junior wrote:
> Hello,
>
> I need a clock algorithm to use with in a simulation system that I be
> creating.
>
>
Practical - Good mix of theory and practice
1. The Art of Multiprocessor Programming" by Maurice Herlihy & Nir Shavit
2. Introduction to Parallel Computing, Second Edition. By Ananth Grama,
Anshul Gupta, George Karypis, Vipin Kumar
3. Herb Sutter's Blog on Concurrency
API Specific
4. Oreilly's Int
I understand the algorithm, but what is the question?
On Wed, Jan 26, 2011 at 10:10 AM, bittu wrote:
> In order to make their newest microcontroller as cheap as possible,
> the ACME Widget Company designed it with a very simple cache. The
> processor is connected to a slow memory system that con
Who said count sort does not uses extra space???
As faras I know, it does need extra space to need thr frequency of each and
every element within a given range..
Regards,
Varun Bhatia
On Mon, Aug 23, 2010 at 4:20 PM, Tanveer Asif wrote:
> Count s
Yeah,,,...lets hope the next turing goes to this Indian. Its still being
verified.
On Thu, Aug 12, 2010 at 12:54 AM, Kishen Das wrote:
>
> http://www.telegraph.co.uk/science/science-news/7938238/Computer-scientist-Vinay-Deolalikar-claims-to-have-solved-maths-riddle-of-P-vs-NP.html
>
> Check out
As far as I know, one simple reason it takes reference to constant class
type is to make sure that the object being copied is not modified in copy
constructor. a object passed as non-const reference can be modified in copy
construcor.
If the formal argument of copy constructor is made as "T obj" i
First attempt: sort them and add the 2 largest numbers
2nd attempt: find 1st and 2nd largest number and add them.
On Wed, Jul 14, 2010 at 7:27 AM, Debajyoti Sarma
wrote:
> An array contains the set of positive integer. Find the largest number
> c such that c=a+b where a,b,c are distinct number of
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Regards,
VARUN BHATIA
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge..
1 - 100 of 129 matches
Mail list logo
