{"blog_url":"https://morchin.hatenadiary.org/","blog_title":"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u65e5\u8a18","type":"rich","image_url":null,"width":"100%","author_url":"https://blog.hatena.ne.jp/morchin/","provider_url":"https://hatena.blog","categories":["Python"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmorchin.hatenadiary.org%2Fentry%2F20060712%2Fp1\" title=\" O(n) vs O(nlogn) - \u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","url":"https://morchin.hatenadiary.org/entry/20060712/p1","title":" O(n) vs O(nlogn)","height":"190","published":"2006-07-12 00:00:00","version":"1.0","description":"Python\u306f\u3001\u30a4\u30f3\u30bf\u30d7\u30ea\u30bf\u578b\u306e\u8a00\u8a9e\u306a\u306e\u3067\u3001\u30a4\u30f3\u30bf\u30d7\u30ea\u30bf\u306e\u30aa\u30fc\u30d0\u30fc\u30d8\u30c3\u30c9\u306b\u6c17\u3092\u3064\u3051\u306a\u3051\u308c\u3070\u306a\u3089\u306a\u3044\u3002\u4ee5\u4e0b\u306e\u3088\u3046\u306a\u30d1\u30d5\u30a9\u30fc\u30de\u30f3\u30b9\u306e\u30c6\u30b9\u30c8\u3092\u884c\u3063\u3066\u307f\u305f\u3002 import time def min1(lst): min_v = lst[0] for v in lst: if min_v > v: min_v = v return min_v def min2(lst): lst_sorted = sorted(lst) return lst_sorted[0] a = range(10000) a.reverse() t1 = time.time() for i in range(10000): v1\u2026","author_name":"morchin"}