排序演算法,

來源:互聯網
上載者:User

排序演算法,

sorted - 廖雪峰

 

 1 L1 = sorted([36,5,-12,9,-21]) 2 print(L1) 3  4 L2 = sorted([36,5,-12,9,-21],key=abs) 5 print(L2) 6  7 L3 = sorted(['bob', 'about', 'Zoo', 'Credit']) 8 print(L3) 9 10 L4 = sorted(['bob', 'about', 'Zoo', 'Credit'], key=str.lower)11 print(L4)12 13 L5 = sorted(['bob', 'about', 'Zoo', 'Credit'], key=str.lower, reverse=True)14 print(L5)15 16 L = [('Bob', 75), ('Adam', 92), ('Bart', 66), ('Lisa', 88)]17 18 def by_name(t):19     return t[0]20 21 def by_score(t):22     return t[1]23 24 L6 = sorted(L,key=by_name)25 L7 = sorted(L,key=by_score,reverse=True)26 print(L6)27 print(L7)

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

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.