Comments on: Easy and fast sorting of objects http://davybrion.com/blog/2007/07/easy-and-fast-sorting-of-objects/ inquisitive: adjective. given to inquiry, research, or asking questions; eager for knowledge; intellectually curious Wed, 08 Feb 2012 11:42:42 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Marc Brookshttp://davybrion.com/blog/2007/07/easy-and-fast-sorting-of-objects/comment-page-1/#comment-36 Marc Brooks Mon, 14 Jan 2008 19:47:34 +0000 http://ralinx.wordpress.com/2007/07/02/easy-and-fast-sorting-of-objects/#comment-36 Glad you guys like it... by the way, it's no included in my Dynamic Reflection Library on CodePlex http://www.codeplex.com/Dynamic Glad you guys like it… by the way, it’s no included in my Dynamic Reflection Library on CodePlex http://www.codeplex.com/Dynamic

]]> By: Davy Brionhttp://davybrion.com/blog/2007/07/easy-and-fast-sorting-of-objects/comment-page-1/#comment-35 Davy Brion Mon, 02 Jul 2007 21:24:44 +0000 http://ralinx.wordpress.com/2007/07/02/easy-and-fast-sorting-of-objects/#comment-35 i believe the correct term is simply 'randomness' :Pstill, regardless of the example i used, this is a great library... makes it really easy to sort whatever collection of business entities you need and because it generates the IL that does the sorting, it's much faster than using reflection. i believe the correct term is simply ‘randomness’ :P

still, regardless of the example i used, this is a great library… makes it really easy to sort whatever collection of business entities you need and because it generates the IL that does the sorting, it’s much faster than using reflection.

]]> By: den benhttp://davybrion.com/blog/2007/07/easy-and-fast-sorting-of-objects/comment-page-1/#comment-34 den ben Mon, 02 Jul 2007 21:11:09 +0000 http://ralinx.wordpress.com/2007/07/02/easy-and-fast-sorting-of-objects/#comment-34 I gave it a go myself and got this output with your code:Elapsed Time: 00:00:00.3104464It got me thinking though... I don't know much about search algoritms but I do know that your generated list is very simple to sort desc (as in reverse-and-you're-done-simple) so I figured I'd throw in some randomnessness (is that a word? ;-)Turns out that went even faster! lol... kinda blew my point though ;-) I gave it a go myself and got this output with your code:

Elapsed Time: 00:00:00.3104464

It got me thinking though… I don’t know much about search algoritms but I do know that your generated list is very simple to sort desc (as in reverse-and-you’re-done-simple) so I figured I’d throw in some randomnessness (is that a word? ;-)

Turns out that went even faster! lol… kinda blew my point though ;-)

]]>