Jump to content
  • Advertisement

Archived

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

linuxopengl

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

This topic is 5530 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

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
Advertisement

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!