Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with c++
Search options not deleted
user 153193
C++ is a statically typed, free-form, multi-paradigm, compiled, general-purpose programming language. This tag should be used for any question which requires knowledge or expertise with the C++ programming language. This is a general tag which is used for any of the C++ language standards (C++98, C++11, C++17, etc.). The question should identify the compiler being used, the operating system, and which of the C++ standards is being targeted.
4
votes
0
answers
1k
views
Selection sort implementation in C++ iterator approach
I am trying to learn the C++ way of writing code. I was wondering if this code could be improved or if there are any major mistakes. Is it ok how I name the variables?
template<typename Iterator, typ …
- 323
3
votes
1
answer
224
views
Selection sort implementation in C++
I was wondering if this implementation of selection sort could be improved. Are there any things that I have done wrong?
template<typename Element>
void selection_sort(Element arr[], size_t size) {
…
- 323
1
vote
1
answer
115
views
Bubble sort implementation in C++
I was wondering if this implementation of bubble sort could be improved. Are there any things that I have done wrong?
template<typename Element>
void bubble_sort(Element arr[], size_t size) {
aut …
- 323
1
vote
1
answer
439
views
C++ insertion sort implementation
I was wondering if this implementation of insertion sort could be improved. Are there any things that I have done wrong?
template<typename Element>
void insertion_sort(Element arr[], size_t size) {
…
- 323
4
votes
2
answers
819
views
Quicksort implementation in C++
I was wondering if this implementation of quicksort could be improved. Are there any things that I have done wrong?
template<typename Element>
size_t partition_quickSort(Element arr[], size_t start, …
- 323
1
vote
1
answer
799
views
Merge sort implementation in C++
I was wondering if this implementation of merge sort could be improved. Are there any things that I have done wrong?
void merge(int *a, int *l, int leftCount, int *r, int rightCount) {
int i = 0, j = …
- 323