Thanks A lot for sharing!!
On Sat, Oct 8, 2011 at 2:03 PM, Rahul Verma rahulverma@gmail.comwrote:
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
Flipkart asks good algo question as well as java question
On Thu, Oct 6, 2011 at 10:10 PM, Akash Mukherjee akash...@gmail.com wrote:
ne updates on flipkart n1??
On Fri, Sep 9, 2011 at 9:53 PM, siva viknesh sivavikne...@gmail.com
wrote:
hi...which coll and package???...plz post the
Kudos to Anna...
On Mon, Aug 22, 2011 at 12:57 AM, Maximilian Anthony
maximilian@gmail.com wrote:
Huge Support to Anna Hazare!!!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
:)*
On Fri, Aug 19, 2011 at 3:33 AM, monty 1987 1986mo...@gmail.com wrote:
@Sanju
I think there exists a restriction in your approach that all numbers
between 1and n has to be present in the array.
Thanks
Soumitra
On Fri, Aug 19, 2011 at 9:53 AM, Sanjay Rajpal
tosanjayraj...@gmail.comwrote
Hi ALL,
It is neither a issue of any sick person , it is the issue that
mother India is sick with corrupt people.
I know that most of us do not have time due to a busy schedule but we have
other resources with us.
I am not man of very high stature still i implore u all to
contribute
The best book is effective java ...but it is not for beginners but SCJP
java book is marvellous !!!
On Mon, Jun 13, 2011 at 5:59 AM, naivenow black.b...@gmail.com wrote:
The Complete Reference By Herbert Shildt is comprehensive.
You can also look up some tutorials on youtube :)
On Jun
Hi ,
i m getting error can u find the error in code for following problem??
We will use the following (standard) definitions from graph theory. Let V be
a nonempty and finite set, its elements being called vertices (or nodes).
Let E be a subset of the Cartesian product V×V, its elements being
hi ,
this is not a research kind of problem i expect a simple answer.
On Wed, Dec 29, 2010 at 2:33 PM, juver++ avpostni...@gmail.com wrote:
Use inplace merge algorithms along with merge sort.
http://www.logiccoder.com/Downloads/krnrd20.pdf
--
You received this message because you are
pointer , two for the lists and the third one for
the position it should be placed.
time complexity will be O(m+n)
On Wed, Dec 29, 2010 at 2:55 PM, monty 1987 1986mo...@gmail.com wrote:
hi ,
this is not a research kind of problem i expect a simple answer.
On Wed, Dec 29, 2010 at 2:33 PM
Suppose you have a matrix n*m. each column and row of the matrix is
already sorted. For example:
1,2,3
2,3,4
4,5,6
*In how much time we can sort the elements of this matrix ?
As far as i m getting idea that if we have n*n elements then we can sort it
in n^3 time*.
It can be done
Given a boolean matrix with all the true elements on left side in the row so
that each row can be broken into two parts left part containing only true
elements and right part containing only false elements. Find the row with
max number of true elements in it.
if the size of matrix is m*n then it
Ye naya Ruby on Rails ka kya funda hai
On Wed, Nov 18, 2009 at 9:37 AM, nitin mathur
nitinkumar.mat...@gmail.comwrote:
Hi
Is there anybody working on Ruby on Rails..Plzz reply if there..
Thnx
Nitin Mathur
Joan Crawfordhttp://www.brainyquote.com/quotes/authors/j/joan_crawford.html
Hi,
Still waiting for solution...
On Wed, Oct 7, 2009 at 3:18 PM, monty 1987 1986mo...@gmail.com wrote:
The important thing is all the points do not lie in same range i.e.
x1 ,x2 ,x3 each of them have their own range.
On Wed, Oct 7, 2009 at 3:15 PM, monty 1987 1986mo
-r1i) / (n-1) !
it means ou put the first point on r1i and the last point on r2i, the
remaining point are distributed with equal distances !
On Oct 5, 5:22 pm, monty 1987 1986mo...@gmail.com wrote:
We have to locate n points on the x-axis
For each point xi
The important thing is all the points do not lie in same range i.e.
x1 ,x2 ,x3 each of them have their own range.
On Wed, Oct 7, 2009 at 3:15 PM, monty 1987 1986mo...@gmail.com wrote:
The min. distance between two points i.e. the euclidean distance between
two points.
On Tue, Oct 6, 2009
We have to locate n points on the x-axis
For each point xi
the x co-ordinate of it lies between a range
[r1i,r2i]
Now we have to decide the location of points such that
minimum { distance between any two points } is maximum.
Any answer is welcomed.
hi frnds,
Can anyone help me to get a tool which will work in Fedora
and contains the facility Latent Semantic Indexing tools
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
Pls see Cormen(Introduction to algorithms)
On Thu, Apr 10, 2008 at 4:42 PM, tenxian [EMAIL PROTECTED] wrote:
I want an interesting book which relates algorithm.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the
Find out why this program is not working which converts list representation
of graph in adjacency matrix
#includeiostream
using namespace std;
struct node
{
node* point;
node* next;
int info;
};
node * getnode(int i);
void adja(int count,node **p);
int main()
{
int
Hi
Can anyone tell me about constraint satisfaying algorithm(simulated
annealing)??
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Hi,
I am highly interested in such type of work.I would like to
work with you
On Jan 24, 2008 5:22 PM, Albert Sanchez [EMAIL PROTECTED] wrote:
Hi,
Anyone interested in road traffic strategies? Flow optimization, time
dependent shortest paths problems?
Albert
Hi Bloke,
I am really interested in some good networking
project.Can anyone suggest me and become my guider?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
Hi
I have to devlop a graphic simulation project in which i hav to
build a graphics engine .
wht does it mean???
On 4/19/07, monty 1987 [EMAIL PROTECTED] wrote:
hi,
Can anyone tell me more about open gl .How is the scope for this
topic
---
monty 1987 wants to stay in better touch using some of Google's coolest new
products.
If you already have Gmail or Google Talk, visit:
http://mail.google.com/mail/b-fd5190c7df-578807e516-572fe5d0cb8f9527
You'll need
My problem is to find out longest subsequence of integers in increasing
order in an array of integers.
If any one have solution tell it to me.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To
Hi Friends,
I have learnt an algorithm regarding the graph i.e. to
find out the* DFS *
DFS(G)
{
for each vertex u of V[G]
do
26 matches
Mail list logo
