{"blog_url":"https://www.sakatakoichi.com/","width":"100%","author_name":"jyukutyo","description":"\u30af\u30a4\u30c3\u30af\u30bd\u30fc\u30c8\u306e\u95a2\u6570\u30b9\u30bf\u30a4\u30eb\u7248\u3002sort1.scala | The Scala Programming Language package sample.snippet /** Quick sort, functional style. */ object sort1 { def sort(a: List[Int]): List[Int] = { if( a.length < 2) a else { val pivot = a(a.length / 2) /* sort(a.filter(_ < pivot)) ::: a.filter(_ == pivot) ::: sort(a.filter\u2026","height":"190","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/jyukutyo/","image_url":null,"categories":["programming"],"blog_title":"Fight the Future","url":"https://www.sakatakoichi.com/entry/20081030/1225332883","version":"1.0","type":"rich","title":"Scala\u306eAdvanced Example\u3092\u5199\u7d4c\u3059\u308b(10)-functional quicksort","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fwww.sakatakoichi.com%2Fentry%2F20081030%2F1225332883\" title=\"Scala\u306eAdvanced Example\u3092\u5199\u7d4c\u3059\u308b(10)-functional quicksort - Fight the Future\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2008-10-31 03:14:43"}