-python implementation of bucket sorting algorithm

Source: Internet
Author: User


< AHA algorithm >

5 Digits 5 3 5 2 8 need sorting.

The idea of using buckets to sort

L=[0,0,0,0,0,0,0,0,0,0]p=[5,3,5,2,8]for I in range (Ten): for J in P:if I==j:l[i]+=1print Lnew_l=[]fo R i in range: #核心点在这里 if l[i]!=0:for J in range (L[i]): New_l.append (i) Print new_l

Simplified to: Yes, yes, if the value is not 0, the corresponding index is output. If the value is 1, output the index once, if the value is 2, enter the index for the two times value.

[0, 0, 1, 1, 0, 2, 0, 0, 1, 0]

-python implementation of bucket sorting algorithm

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.