docs(10_Wiki): Dev 폴더 누락분 반영 — Topic_Programming으로 통합

이전 재구성 작업에서 Dev/ 폴더가 누락되었던 것을 반영.

- Dev/Topic_Programming(중첩 폴더, 78개)은 Dev 자체 최상위 폴더들
  (Architecture/Conventions/Engineering_Intelligence 등)과 완전 중복이라 제거.
- Dev 최상위 엔지니어링 지식 폴더(Architecture/Conventions/Engineering_Intelligence/
  Failure_Library/Generalized_Principles/Language/Pattern_Catalog/Platform_Guides/
  Subsystems, 77개)는 이미 Topic_Programming/Topic_Programming에 더 최신 버전이
  존재해 중복 제거(고유 콘텐츠 1개는 예외 처리하여 이동 보존).
- Dev의 W3Schools 언어 튜토리얼 폴더(Topic_C/CPP/CSS/CSharp/HOWTO/HTML/Java/
  JavaScript/PHP/Python/SQL/W3CSS, 1201개)는 전부 Topic_Programming 하위로 이동.
- 에이전트 운영 상태(.astra/docs)는 그대로 유지, 콘텐츠 폴더만 정리.
- Topic_Programming 최종 문서 수: 2784 → 3985.

10_Wiki/Topic_Programming/Topic_CPP/CPP_Algorithms.md

@@ -0,0 +1,86 @@
+---
+id: cpp-algorithms
+title: "C++ Algorithms"
+category: "Programming_Language"
+status: "draft"
+verification_status: "conceptual"
+canonical_id: ""
+aliases: ["<algorithm> library", "sort find C++", "C++ 알고리즘"]
+duplicate_of: ""
+source_trust_level: "B"
+confidence_score: 0.86
+created_at: 2026-07-04
+updated_at: 2026-07-04
+review_reason: ""
+merge_history: []
+tags: ["cpp", "programming-language", "w3schools", "stl", "algorithm"]
+raw_sources: ["https://www.w3schools.com/cpp/cpp_algorithms.asp"]
+applied_in: []
+github_commit: ""
+---
+
+# [[CPP Algorithms]]
+
+## 🎯 한 줄 통찰 (One-line insight)
+Every `<algorithm>` function takes a RANGE (a begin/end iterator pair) instead of a container, which is why `sort(numbers.begin() + 3, numbers.end())` can sort just a SUBSET of a vector by simple iterator arithmetic — this is the payoff of the previous chapter's iterator abstraction: because `sort()`/`find()`/`min_element()` never see the container type directly, the exact same function signature works whether the range came from a full vector, a partial vector, or (implicitly) any other iterator-supporting container, something C has no equivalent for since `qsort()` needs a raw array pointer + element count instead of a reusable "range" concept. [S1]
+
+## 🧠 핵심 개념 (Core concepts)
+- **`<algorithm>` header** — required for all functions in this chapter (`sort`, `find`, `upper_bound`, `min_element`, `max_element`, `copy`, `fill`). [S1]
+- **`sort(begin, end)`** — sorts a range in ascending order by default (alphabetically for strings, numerically for ints); reversible via `rbegin()`/`rend()` instead of `begin()`/`end()`. [S1]
+- **Partial-range sort** — `sort(numbers.begin() + 3, numbers.end())` sorts only from the 4th element onward, leaving earlier elements untouched — only possible because the function operates on an iterator range, not "the whole container." [S1]
+- **`find(begin, end, value)`** — returns an iterator to the first match (or `end()` if not found, implied by the general iterator convention). [S1]
+- **`upper_bound(begin, end, value)`** — finds the first element GREATER than `value`; REQUIRES the range to already be sorted, since it relies on binary-search-like assumptions. [S1]
+- **`min_element(begin, end)` / `max_element(begin, end)`** — return an iterator to the smallest/largest element in the range. [S1]
+- **`copy(src_begin, src_end, dest_begin)`** — copies a range of elements into another container starting at `dest_begin`; the destination must already have enough space allocated (e.g. `vector<int> copiedNumbers(6);`). [S1]
+- **`fill(begin, end, value)`** — overwrites every element in the range with `value`. [S1]
+
+## 📖 세부 내용 (Details)
+- Ascending sort: `sort(cars.begin(), cars.end());` — strings sort alphabetically, ints sort numerically. [S1]
+- Descending sort via reverse iterators: `sort(numbers.rbegin(), numbers.rend());`. [S1]
+- Search: `auto it = find(numbers.begin(), numbers.end(), 3);` finds the value 3. [S1]
+- Sorted-data search: `sort(numbers.begin(), numbers.end()); auto it = upper_bound(numbers.begin(), numbers.end(), 5);` — must sort FIRST, since `upper_bound` assumes sorted input. [S1]
+- Min/max: `auto it = min_element(numbers.begin(), numbers.end());` / `auto it = max_element(numbers.begin(), numbers.end());`. [S1]
+- Copy: `vector<int> copiedNumbers(6); copy(numbers.begin(), numbers.end(), copiedNumbers.begin());`. [S1]
+- Fill: `vector<int> numbers(6); fill(numbers.begin(), numbers.end(), 35);` sets all 6 elements to 35. [S1]
+
+## ⚖️ 모순 및 업데이트 (Contradictions & updates)
+- **범위(iterator pair) 기반 설계가 부분 정렬을 가능하게 함**: C의 `qsort()`는 배열 포인터와 전체 요소 개수를 받아야 했지만, C++의 `sort()`는 begin/end iterator만 받으므로 `numbers.begin() + 3`처럼 iterator 연산만으로 컨테이너의 일부 구간만 정렬할 수 있다는 점이 확인됨 — 이는 이전 챕터(Iterators)에서 확립된 범위 추상화의 직접적인 활용 사례. [S1]
+- **`upper_bound()`는 정렬 전제 조건이 있음**: `find()`나 `min_element()`와 달리 `upper_bound()`는 정렬되지 않은 데이터에 사용하면 올바른 결과를 보장하지 않으며, 원문도 반드시 먼저 `sort()`를 호출한 뒤 사용하도록 명시함. [S1]
+
+## 🛠️ 적용 사례 (Applied in summary)
+정렬되지 않은 정수 vector를 먼저 sort()로 정렬한 뒤 upper_bound()로 특정 값보다 큰 첫 원소를 찾는 2단계 예제가 원문에서 직접 실전 활용 사례로 제시됨. [S1]
+
+## 💻 코드 패턴 (Code patterns)
+Partial-range sort and sorted-precondition search (C++):
+```cpp
+#include <algorithm>
+#include <vector>
+
+vector<int> numbers = {1, 7, 3, 5, 9, 2};
+
+sort(numbers.begin() + 3, numbers.end());   // sorts only 5,9,2 -> leaves 1,7,3 untouched
+
+sort(numbers.begin(), numbers.end());       // must sort first...
+auto it = upper_bound(numbers.begin(), numbers.end(), 5);  // ...for upper_bound to be valid
+
+auto smallest = min_element(numbers.begin(), numbers.end());
+auto largest  = max_element(numbers.begin(), numbers.end());
+```
+
+## ✅ 검증 상태 및 신뢰도
+- **상태:** draft
+- **검증 단계:** conceptual
+- **출처 신뢰도:** B (W3Schools — widely used educational reference, not a primary standards body)
+- **신뢰 점수:** 0.86
+- **중복 검사 결과:** 신규 생성 (New discovery)
+
+## 🔗 지식 그래프 (Knowledge Graph)
+- **상위/루트:** [[C++ Tutorial]]
+- **관련 개념:** [[CPP Iterators]], [[CPP Vectors]], [[CPP Data Structures]]
+- **참조 맥락:** 데이터 구조(STL) 섹션의 마지막 챕터 — Auto 섹션으로 이어짐.
+
+## 📚 출처 (Sources)
+- [S1] W3Schools — C++ Algorithms — https://www.w3schools.com/cpp/cpp_algorithms.asp
+
+## 📝 변경 이력 (Change history)
+- 2026-07-04: Initial draft synthesized from the W3Schools "C++ Algorithms" page (Astra wiki-curation, P-Reinforce v3.1 format).