{"blog_url":"https://obelisk.hatenablog.com/","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/obelisk2/","published":"2016-01-25 23:34:16","blog_title":"Camera Obscura","url":"https://obelisk.hatenablog.com/entry/2016/01/25/233416","categories":["Ruby","\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0"],"image_url":"https://images-fe.ssl-images-amazon.com/images/I/51foeCpfmQL._SL160_.jpg","type":"rich","provider_url":"https://hatena.blog","title":"\u30de\u30fc\u30b8\u30bd\u30fc\u30c8","width":"100%","description":"\u30d7\u30ed\u30b0\u30e9\u30e0\u306e\u6027\u8cea\u4e0a\u3001\u7834\u58ca\u7684\u306a\u30e1\u30bd\u30c3\u30c9\u306b\u306a\u308a\u307e\u3059\u3002merge_sort.rb class Array def merge(p, q ,r) left = self[p..q] + [Float::INFINITY] right = self[(q + 1)..r] + [Float::INFINITY] i = j = 0 for k in p..r if left[i] <= right[j] self[k] = left[i] i += 1 else self[k] = right[j] j += 1 end end end def merge_sort(p, r) return if p \u2026","version":"1.0","author_name":"obelisk2","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fobelisk.hatenablog.com%2Fentry%2F2016%2F01%2F25%2F233416\" title=\"\u30de\u30fc\u30b8\u30bd\u30fc\u30c8 - Camera Obscura\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}