tag:blogger.com,1999:blog-8931503663398104354.post6562723139121328645..comments2024-02-20T11:13:23.838+01:00Comments on Allan on Technology: C# and keeping your lists sortedAllan Thrænhttp://www.blogger.com/profile/07564156126391105596noreply@blogger.comBlogger5125tag:blogger.com,1999:blog-8931503663398104354.post-30883553985654081642012-07-01T06:57:35.864+01:002012-07-01T06:57:35.864+01:00Just looked at Marcin Hoppe's version and thou...Just looked at Marcin Hoppe's version and though it leverages the BinarySearch, this is useless if you need to leverage a Comparable class instead of a list of Integers.<br /><br />Thank you for this version Allan, definitely using this.Gates VPhttps://www.blogger.com/profile/13840555181094178187noreply@blogger.comtag:blogger.com,1999:blog-8931503663398104354.post-21988352479485236442012-05-06T11:13:22.134+01:002012-05-06T11:13:22.134+01:00See http://devlicio.us/blogs/marcin_hoppe/archive/...See http://devlicio.us/blogs/marcin_hoppe/archive/2007/05/15/how-to-keep-list-t-sorted.aspx for a better approach that uses List.BinarySearch.splintorhttps://www.blogger.com/profile/04817781753093724642noreply@blogger.comtag:blogger.com,1999:blog-8931503663398104354.post-37100505029194405422007-02-20T13:58:00.000+01:002007-02-20T13:58:00.000+01:00Just for completeness I tried to run the same test...Just for completeness I tried to run the same test as described in the post with SortedArray from the C5 library. It took 30 ms so it's 10 ms faster than my algorithm!<BR/>I'll make sure to post again when I've found out what to do with all this new-found time. Perhaps it's time to take up a hobby :-)Allan Thrænhttps://www.blogger.com/profile/07564156126391105596noreply@blogger.comtag:blogger.com,1999:blog-8931503663398104354.post-27822808305036958992007-02-19T17:56:00.000+01:002007-02-19T17:56:00.000+01:00Thanks Alex. I think I heard about that library (n...Thanks Alex. I think I heard about that library (not so strange considering I go to the same school).<BR/>I'll make sure to check it out. Thanks for the tip!Allan Thrænhttps://www.blogger.com/profile/07564156126391105596noreply@blogger.comtag:blogger.com,1999:blog-8931503663398104354.post-27889247796659738102007-02-19T13:40:00.000+01:002007-02-19T13:40:00.000+01:00Hello Allan,I've got the exact same problem as you...Hello Allan,<BR/><BR/>I've got the exact same problem as you have. By accident I came across the C5 library. It's based on the principles you've learned at school and it's dramatically fast ;-).<BR/>It contains stuff like SortedArrays, Trees, etc. Very cool. Check out at:<BR/>http://www.itu.dk/research/c5/Anonymousnoreply@blogger.com