Did any one implement this in nlogn ??
Reference: http://en.wikipedia.org/wiki/Longest_increasing_subsequence
--
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
@Gene : Thanx for the reply. Understood your point.
On Tue, Mar 6, 2012 at 6:24 AM, Gene gene.ress...@gmail.com wrote:
What Don so succinctly said is this: Comparison sort _requires_ O(n
log n) comparisons. If you had the data structure you're asking for,
you could easily implement a
@atul: Well yes this might help, thanks :)
On Tue, Mar 6, 2012 at 4:24 PM, atul anand atul.87fri...@gmail.com wrote:
hope this will help you :-
http://www.algorithmist.com/index.php/Longest_Increasing_Subsequence.cpp
On Tue, Mar 6, 2012 at 3:26 PM, ankur best.an...@gmail.com wrote:
Did
Not at the moment as I'm traveling. Sorry. You could start with
http://en.wikipedia.org/wiki/Modular_arithmetic . The references
might be helpful.
I'll illustrate what Im talking about. Let M=7. Then here is a
table of inverses and checks:
All mod 7 arithmetic
Inverse Check
1 ^ 5 = 1
VCE hyderabad
On Mon, Mar 5, 2012 at 3:28 PM, adarsh kumar algog...@gmail.com wrote:
Which college?
On Sun, Mar 4, 2012 at 10:16 AM, teja bala pawanjalsa.t...@gmail.comwrote:
Google is visiting our campus 4 different roles As of now IT field
technician is confirmed so how to approach
A similar problem which *is* possible is this:
How would you implement a stack providing LIFO insert and delete AND
the ability to report the minimum value in the stack each in constant
time.
The solution is to keep a second stack for the minimum values. When an
item is inserted, you push it
This is a nice paper. I think that for matrix multiplication it ends
up saying pretty much the same as we've been discussing.
The OP said serial code. Vector code isn't serial. However it's
easy to try vectorization these days. The latest versions of gcc will
do a very reasonable job with the
The dcache uses this to hash directory names. It looks pretty close
to the old Dragon Book rotate-and-xor algorithm.
24 struct qstr {
25 const unsigned char * name;
26 unsigned int len;
27 unsigned int hash;
28 };
29
30 /* Name hashing routines. Initial hash value
