\uba54\ubaa8\ub9ac \uae30\ubc18\uc758 \ubc29\ub300\ud55c \ub370\uc774\ud0c0\uac00 \uc788\ub2e4\uace0 \uac00\uc815\uc744 \ud560 \ub54c.. \uc774 \ub370\uc774\ud130 \ubaa9\ub85d \uc911 \uc5b4\ub5a4 \ub370\uc774\ud0c0\uac00 \uc874\uc7ac\ud558\ub294\uc9c0\uc758 \uc5ec\ubd80\ub97c \uac00\uc7a5 \ube60\ub974\uac8c \uac80\uc0c9\ud574\uc8fc\ub294 \ubc29\uc2dd\uc774 binary_search\uc778\ub370\uc694. \uc774 STL \ud568\uc218\ub97c \uc815\ub9ac\ud574 \ubd05\ub2c8\ub2e4.<\/p>\n
\uba3c\uc800 \uba54\ubaa8\ub9ac \uae30\ubc18\uc758 \ubc29\ub300\ud55c \ub370\uc774\ud130\ub97c \uc900\ube44\ud574 \ubd05\ub2c8\ub2e4.<\/p>\n
\r\n#include <iostream>\r\n#include <list>\r\n#include <algorithm>\r\n#include <iterator>\r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n list<int> values{ 1, 2, 8, 7 ,6, 5, 4, 1, 9, 3, 5, 6, 7 };\r\n\r\n}<\/pre>\n\ub370\uc774\ud0c0\uac00 \uba87\uac1c \ub418\uc9c0 \uc54a\uc9c0\ub9cc \ubc29\ub300\ud558\ub2e4\uace0 \uce69\uc2dc\ub2e4. binary_search\ub97c \uc0ac\uc6a9\ud558\uae30 \uc704\ud574\uc11c\ub294 \uba3c\uc800 \ub370\uc774\ud130\uac00 \uc815\ub82c\ub418\uc5b4 \uc788\uc5b4\uc57c \ud569\ub2c8\ub2e4. \ub0b4\ub9bc\ucc28\uc21c\uc73c\ub85c \uc815\ub82c\ud558\ub294 \ucf54\ub4dc\ub97c \ucd94\uac00\ud558\uba74.. \ub2e4\uc74c\uacfc \uac19\uc2b5\ub2c8\ub2e4.<\/p>\n
\r\n#include <iostream>\r\n#include <list>\r\n#include <algorithm>\r\n#include <iterator>\r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n list<int> values{ 1, 2, 8, 7 ,6, 5, 4, 1, 9, 3, 5, 6, 7 };\r\n auto predicate = [](int a, int b) { return a > b; };\r\n values.sort(predicate);\r\n\r\n copy(values.begin(), values.end(), ostream_iterator<double>{ std::cout, \" \"});\r\n cout << endl;\r\n}<\/pre>\n\ub78c\ub2e4 \ud568\uc218\ub85c \ub0b4\ub9bc\ucc28\uc21c \uc815\ub82c\uc744 \uc704\ud55c \uae30\uc900\uc73c\ub85c \uc0bc\uc558\uc2b5\ub2c8\ub2e4. \uadf8\ub9ac\uace0 \uc798 \uc815\ub82c\ub418\uc5c8\ub294\uc9c0 \ucf58\uc194\uc5d0 \ud45c\uc2dc\ud574 \ubcf4\uc558\uad6c\uc694. \uc774\uc81c binary_search \ud568\uc218\ub97c \uc0ac\uc6a9\ud558\uae30 \uc704\ud55c \ub370\uc774\ud130 \ub369\uc5b4\ub9ac\uac00 \uc900\ube44 \ub418\uc5c8\uace0, \ub2e4\uc74c\ucc98\ub7fc \ub370\uc774\ud130 \ub369\uc5b4\ub9ac\uc911 \uac12 5\uac00 \uc874\uc7ac\ud558\ub294\uc9c0\uc758 \uc5ec\ubd80\ub97c \uac80\uc0c9\ud558\ub294 \ucf54\ub4dc\ub294 \ub2e4\uc74c\uacfc \uac19\uc2b5\ub2c8\ub2e4.<\/p>\n
\r\n#include <iostream>\r\n#include <list>\r\n#include <algorithm>\r\n#include <iterator>\r\n\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n list<int> values{ 1, 2, 8, 7 ,6, 5, 4, 1, 9, 3, 5, 6, 7 };\r\n auto predicate = [](int a, int b) { return a > b; };\r\n values.sort(predicate);\r\n\r\n copy(values.begin(), values.end(), ostream_iterator<double>{ std::cout, \" \"});\r\n cout << endl;\r\n\r\n int wanted{ 5 };\r\n bool bSearched = binary_search(begin(values), end(values), wanted, predicate);\r\n if (bSearched) {\r\n cout << \"Found !\" << endl;\r\n } else {\r\n cout << \"Not found.\" << endl;\r\n }\r\n}<\/pre>\n","protected":false},"excerpt":{"rendered":"\uba54\ubaa8\ub9ac \uae30\ubc18\uc758 \ubc29\ub300\ud55c \ub370\uc774\ud0c0\uac00 \uc788\ub2e4\uace0 \uac00\uc815\uc744 \ud560 \ub54c.. \uc774 \ub370\uc774\ud130 \ubaa9\ub85d \uc911 \uc5b4\ub5a4 \ub370\uc774\ud0c0\uac00 \uc874\uc7ac\ud558\ub294\uc9c0\uc758 \uc5ec\ubd80\ub97c \uac00\uc7a5 \ube60\ub974\uac8c \uac80\uc0c9\ud574\uc8fc\ub294 \ubc29\uc2dd\uc774 binary_search\uc778\ub370\uc694. \uc774 STL \ud568\uc218\ub97c \uc815\ub9ac\ud574 \ubd05\ub2c8\ub2e4. \uba3c\uc800 \uba54\ubaa8\ub9ac \uae30\ubc18\uc758 \ubc29\ub300\ud55c \ub370\uc774\ud130\ub97c \uc900\ube44\ud574 \ubd05\ub2c8\ub2e4. #include <iostream> #include <list> #include <algorithm> #include <iterator> using namespace std; int main() { list<int> values{ 1, 2, 8, 7 ,6, 5, … <\/p>\n