Archived

This topic is now archived and is closed to further replies.

linuxopengl

how can I make the worst case of merge sort...

Recommended Posts

linuxopengl    122
I learned merge sort algorithm. but I want to Re-Sort to be the worst case of merge sort. I mean, I want to comfirm the formula, number of comparison , ( nlogn-n+1 ) anybody help me!

Share this post


Link to post
Share on other sites