Comments on: Longest Increasing Subsequence http://eli.thegreenplace.net/2006/04/18/longest-increasing-subsequence/ Eli Bendersky's personal website Fri, 21 Nov 2008 13:10:25 +0000 http://wordpress.org/?v=2.6.2 By: eliben http://eli.thegreenplace.net/2006/04/18/longest-increasing-subsequence/#comment-18 eliben Tue, 18 Apr 2006 14:05:14 +0000 http://eli.thegreenplace.net/2006/04/18/longest-increasing-subsequence/#comment-18 My implementation follows the Fisher Yates shuffle algorithm. See: http://pleac.sourceforge.net/pleac_ruby/arrays.html Also, yours is O(n*logn) which is an overkill for an obviously linear task. My implementation follows the Fisher Yates shuffle algorithm. See:
http://pleac.sourceforge.net/pleac_ruby/arrays.html

Also, yours is O(n*logn) which is an overkill for an obviously linear task.

]]> By: Simen http://eli.thegreenplace.net/2006/04/18/longest-increasing-subsequence/#comment-15 Simen Tue, 18 Apr 2006 13:00:43 +0000 http://eli.thegreenplace.net/2006/04/18/longest-increasing-subsequence/#comment-15 Just a little pointer: the usual way to sort an Array randomly in Ruby is simply sorting by <code>rand</code>. Example: <code> def shuffle_sequence!( a ) a.sort! { rand } end sequence = (0..10).to_a shuffle_sequence! sequence # => randomized array </code> Just a little pointer: the usual way to sort an Array randomly in Ruby is simply sorting by rand. Example:


def shuffle_sequence!( a )
a.sort! { rand }
end

sequence = (0..10).to_a
shuffle_sequence! sequence # => randomized array

]]>