{"image_url":null,"url":"https://kenta11626918.hatenadiary.org/entry/20110403/1301794699","title":"\u914d\u5217\u7fa4 MyArray","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkenta11626918.hatenadiary.org%2Fentry%2F20110403%2F1301794699\" title=\"\u914d\u5217\u7fa4 MyArray - Set::prototype\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/kenta11626918/","version":"1.0","blog_title":"Set::prototype","provider_url":"https://hatena.blog","description":"namespace MyArray { //[begin, end)\u306e\u7bc4\u56f2\u3067\u306e\u914d\u5217\u306e\u6700\u5c0f\u5024\u306e\u30a4\u30f3\u30c7\u30c3\u30af\u30b9\u3092\u6c42\u3081\u308b template int ArrayMinIndex(TYPE* array, int begin, int end) { int min = begin; //return for(int i = begin+1; i array[i]) { min = i; } } return min; } //[begin, end)\u306e\u7bc4\u56f2\u3067\u306e\u914d\u5217\u306e\u6700\u5927\u5024\u306e\u30a4\u30f3\u30c7\u30c3\u30af\u30b9\u3092\u6c42\u3081\u308b template int ArrayMaxIndex(TYPE* array, int begin, int e\u2026","published":"2011-04-03 10:38:19","provider_name":"Hatena Blog","type":"rich","categories":["\u81ea\u4f5c\u95a2\u6570","C++","\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8"],"blog_url":"https://kenta11626918.hatenadiary.org/","height":"190","author_name":"kenta11626918"}