tag:blogger.com,1999:blog-6469704299235308349.post1382840275026290100..comments2016-02-03T20:16:34.340+11:00Comments on -ck hacking: cksort evolutionckhttp://www.blogger.com/profile/02904761195451530213noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-6469704299235308349.post-90303552479742503932011-10-10T22:12:40.379+11:002011-10-10T22:12:40.379+11:00Both. You heapsort after generating a heap. I foun...Both. You heapsort after generating a heap. I found the tipping point to be 32 nodes beyond which an O(n log n) sort is faster. Even with the heap like shape of the presort, it turns out that speeding up the generation of the heap itself does not significantly speed up heapsort, and it's better to abort out of the presort when it's going to add a lot of time. More soon. I've experimented with tipping from this algorithm into a mergesort instead.ckhttp://www.blogger.com/profile/02904761195451530213noreply@blogger.comtag:blogger.com,1999:blog-6469704299235308349.post-32732945952705440802011-10-10T22:08:38.283+11:002011-10-10T22:08:38.283+11:00did you just say 'heap' or 'heapsort&#...did you just say 'heap' or 'heapsort'?<br />http://en.wikipedia.org/wiki/HeapsortAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-6469704299235308349.post-28216511774381897352011-10-09T23:48:02.350+11:002011-10-09T23:48:02.350+11:00Really interesting algorithm. Keep up the good wor...Really interesting algorithm. Keep up the good work my friend :)Anonymousnoreply@blogger.com