{"id":52,"date":"2007-02-25T11:11:55","date_gmt":"2007-02-25T20:11:55","guid":{"rendered":"http:\/\/www.evardsson.com\/blog\/2007\/02\/25\/new-sorting-algorithm-promises-improved-performance\/"},"modified":"2007-02-25T11:44:13","modified_gmt":"2007-02-25T20:44:13","slug":"new-sorting-algorithm-promises-improved-performance","status":"publish","type":"post","link":"https:\/\/www.evardsson.com\/blog\/2007\/02\/25\/new-sorting-algorithm-promises-improved-performance\/","title":{"rendered":"New(?) sorting algorithm"},"content":{"rendered":"<p>George Papadopoulos has released <a href=\"http:\/\/www.phoenixbit.com\/site\/projects\/Programming\/Sorting%20Link%20Lists\/bitfast.zip\">BitFast<\/a> &#8211; a linked list sorting algorithm with examples written in C and C++. He claims sort performance 10 times faster than the <a href=\"http:\/\/en.wikipedia.org\/wiki\/Merge_sort\">MergeSort Algorithm<\/a>. (But where is the <a href=\"http:\/\/en.wikipedia.org\/wiki\/Big_oh\">Big O notation<\/a>?)<\/p>\n<p>You can see the <a href=\"http:\/\/www.phoenixbit.com\/site\/projects.asp?view=UHJvZ3JhbW1pbmcvU29ydGluZyBMaW5rIExpc3Rz\">project site<\/a>, which has a download link for the C and C++ source code. The explanation is fairly clear, although it seems a little sparse to me. The source code lacks in comments, and has been written as proof of concept only, but it will provide the experienced C or C++ developer with a better understanding of what he is doing.<\/p>\n<p>Mostly, it looks like he is applying the <a href=\"http:\/\/en.wikipedia.org\/wiki\/Radix_sort\">Radix Sort Algorithm<\/a> to linked lists of integers or floats. This does nothing for strings, and the proof-of-concept code is only set up to handle 32 bit number values only.  Perhaps the only difference between Radix and BitFast, is that Papadopoulos  claims that BitFast is an <a href=\"http:\/\/en.wikipedia.org\/wiki\/In-place\">in-place algorithm<\/a> and an <a href=\"http:\/\/en.wikipedia.org\/wiki\/Online_algorithm\">online algorithm<\/a>.<\/p>\n<p>Technorati Tags: <a href=\"http:\/\/technorati.com\/tag\/BitFast\" class=\"performancingtags\" rel=\"tag\">BitFast<\/a>, <a href=\"http:\/\/technorati.com\/tag\/algorithm\" class=\"performancingtags\" rel=\"tag\">algorithm<\/a>, <a href=\"http:\/\/technorati.com\/tag\/George%20Papadopoulos\" class=\"performancingtags\" rel=\"tag\">George Papadopoulos <\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>George Papadopoulos has released BitFast &#8211; a linked list sorting algorithm with examples written in C and C++. He claims sort performance 10 times faster than the MergeSort Algorithm. (But where is the Big O &hellip;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[11],"tags":[148],"class_list":["post-52","post","type-post","status-publish","format-standard","hentry","category-development","tag-development"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/pxT7i-Q","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/posts\/52","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/comments?post=52"}],"version-history":[{"count":0,"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/posts\/52\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/media?parent=52"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/categories?post=52"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.evardsson.com\/blog\/wp-json\/wp\/v2\/tags?post=52"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}