| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 8 | 9 | 10 | 11 | 12 | 13 | 14 |
| 15 | 16 | 17 | 18 | 19 | 20 | 21 |
| 22 | 23 | 24 | 25 | 26 | 27 | 28 |
| 29 | 30 | 31 |
- 운영체제
- map
- list
- directx
- Stack
- 라인트레이서
- 아두이노 소스
- Algorithm
- 컴퓨터 그래픽스
- 통계학
- html
- 시스템프로그래밍
- Array
- c++
- arduino compiler
- vector
- LineTracer
- set
- priority_queue
- stl
- Deque
- Arduino
- WinAPI
- Visual Micro
- 아두이노
- 자료구조
- 수광 소자
- 아두이노 컴파일러
- queue
- C언어
- Today
- Total
목록STL - Algorithm (82)
Kim's Programming
Algorithm - lexicographical_compare()
원형) 12345678910//기본형template bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); //사용자 정의형template bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp);Colored by Color Scriptercs 의미) first1(포함)부터 last1 바로 앞까지와 first2(포함)부터 last2 비교하여 first2~last2사이의..
Algorithm - search_n()
소스) 12345678910111213141516171819202122232425262728#include#include#includebool search_n_bool(int i, int j){ if (i == j + 1) return true; return false;} int main(){ std::vector Vector = { 1,1,3,3,4,4,5,5,6,6,6,7,7,7,7}; std::vector::iterator Iter; Iter = std::search_n(Vector.begin(), Vector.end(), 3, 7); if (Iter != Vector.end()) std::cout
Algorithm - search()
소스) 12345678910111213141516171819202122232425262728293031#include#include#includebool search_bool(int i, int j){ if (i == j) return true; return false;} int main(){ std::vector Vector = { 1,3,5,7,9,11,13,15 }; int Array[] = { 7,9,11 }; std::vector::iterator Iter; Iter = std::search(Vector.begin(), Vector.end(), Array, Array + 3); if (Iter != Vector.end()) std::cout
Algorithm - is_permutation()
소스) 12345678910111213141516171819#include#include#includebool compare(int i, int j){ if (i == j) return true; return false;}void main(){ int Array[] = { 10,20,30,40,50 }; std::vector Vector = { 30,10,20,50,40}; if (std::is_permutation(Vector.begin(), Vector.end(), Array)) std::cout
Algorithm - equal()
소스) 123456789101112131415161718192021222324252627#include#include#includebool compare(int i, int j){ if (i == j) return true; return false;}void main(){ int Array[] = { 10,20,30,40,50 }; std::vector Vector = { 10,20,30,40,50}; if (std::equal(Vector.begin(), Vector.end(), Array)) std::cout
Algorithm - mismatch()
소스) 123456789101112131415#include#include#include void main(){ std::vector Vector = { 10,20,30,40,50}; int Array[] = { 10,20,80,320,1024 }; std::pair Pair; Pair = std::mismatch(Vector.begin(), Vector.end(),Array); std::cout
Algorithm - count_if()
소스) 1234567891011121314151617#include#include#include bool count_comp(int i){ if (i
Algorithm - count()
소스) 1234567891011121314151617181920#include#include#include bool find_adj(int i,int j){ if (i == j) return true; return false;} void main(){ int Array[] = { 1,3,5,3,9,11,1,3,5,11,1,3,1 }; std::vector Vector = { 1,3,3,5,7,7,9,11,13,15 }; std::cout