| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | lesson40_*: Resolve midpoint sum overflow, mention std::midpoint | Sven Göthel | 2024-05-06 | 1 | -1/+2 |
| | | |||||
| * | Resolve clang-tidy warnings=error; Notable std::vector<>: size() -> size_t ↵ | Sven Göthel | 2024-05-03 | 1 | -3/+3 |
| | | | | | | | | | | | | (unsigned) but iterator and difference_type are signed and losing half of range Because std::vector<>::begin() iterator performs arithmetic using a signed difference_type, we need to use such a signed type here to avoid `bugprone-narrowing-conversions` (LINT) Now, isn't this odd as std::vector<>::size() uses unsigned size_type, aka size_t and mentioned iterator hence lose half the value range possible? | ||||
| * | lesson40_algo12: Cleanup: Use value-reference for pivot-points reducing ↵ | Sven Göthel | 2024-04-24 | 1 | -34/+37 |
| | | | | | lookup, rename 'array' -> 'A' | ||||
| * | lesson40_algo12: hoare2: Cleanup my own partitioning trial | Sven Göthel | 2024-04-24 | 1 | -38/+1 |
| | | |||||
| * | lesson40_algo12: Hoare-Yaroslavskiy: Simplify end-partition 2-swaps by ↵ | Sven Göthel | 2024-04-24 | 1 | -17/+11 |
| | | | | | pre-swapping hi/lo pivot at start | ||||
| * | lesson40_algo12: Hoare-Yaroslavskiy: Use reference to pivots adding ↵ | Sven Göthel | 2024-04-24 | 1 | -5/+15 |
| | | | | | std::move for 2x 3-way swap at end of partitioning | ||||
| * | lesson40_algo12: Merge partition into qsort; Add Hoare-Yaroslavskiy ↵ | Sven Göthel | 2024-04-23 | 1 | -102/+141 |
| | | | | | dual-pivot quicksort variant (claimed >= 10% faster) | ||||
| * | Adding lesson 40: binary-search *01.cpp, +sorted_insert *02 and quicksort ↵ | Sven Göthel | 2024-04-23 | 1 | -0/+405 |
| *12.cpp, each with optional variations | |||||
 |
index : cs_class/cpp_basics.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| aboutsummaryrefslogtreecommitdiffstats |