Programming algorithms-horse racing

Source: Internet
Author: User
Horse racing Problems


Address: http://blog.csdn.net/caroline_wendy


For horse racing, there are 25 horses, three of which are the fastest, five of which are the first. How can I choose?


Solution:

SimilarK-path Merge Sorting, DividedFive groupsIn the competition, select five first places, then conduct the competition, confirm one, and take the first place away. Then, from the first place queue, select the second place, and place it in the queue for the competition.

And so on, selectOptimal 3 horses.


TotalEight comparisons are required., Five primary selections, three selects the best.




Programming algorithms-horse racing

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.