Is this considered bubble sort or selection sort?Bubble sort algorithm in JavaScriptHeap selection sort in...
Use Mercury as quenching liquid for swords?
Short scifi story where reproductive organs are converted to produce "materials", pregnant protagonist is "found fit" to be a mother
Is there stress on two letters on the word стоят
How exactly does an Ethernet collision happen in the cable, since nodes use different circuits for Tx and Rx?
How can a demon take control of a human body during REM sleep?
What does *dead* mean in *What do you mean, dead?*?
When an outsider describes family relationships, which point of view are they using?
What sort of fish is this
Difference between `nmap local-IP-address` and `nmap localhost`
PTIJ: Who was the sixth set of priestly clothes for?
Is this Paypal Github SDK reference really a dangerous site?
Is there a math expression equivalent to the conditional ternary operator?
Giving a career talk in my old university, how prominently should I tell students my salary?
How do I increase the number of TTY consoles?
Was it really inappropriate to write a pull request for the company I interviewed with?
Too soon for a plot twist?
Factor Rings over Finite Fields
Can I negotiate a patent idea for a raise, under French law?
Translation of 答えを知っている人はいませんでした
I am the person who abides by rules, but breaks the rules. Who am I?
Is there a way to make cleveref distinguish two environments with the same counter?
Numerical value of Determinant far from what it is supposed to be
How to copy the rest of lines of a file to another file
Idiom for feeling after taking risk and someone else being rewarded
Is this considered bubble sort or selection sort?
Bubble sort algorithm in JavaScriptHeap selection sort in JavaExact sort - sorting with few move operationsFord-Johnson merge-insertion sortSort array of objects with hierarchy by hierarchy and nameHackerrank Insertion Sort Part 2SPOJ GENERAL: sorting by swaps of distance kCustom sorting algo / optimized bubble sortShuffling an array keeping some elements fixedSort int array by frequency then value
$begingroup$
#include <iostream>
int main() {
int arr[10]{10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
for (int i = 0; i < 10; i++) {
for (int j = i + 1; j < 10; j++) {
if (arr[i] > arr[j]) {
std::swap(arr[i], arr[j]);
}
}
}
// now the array is sorted!
return 0;
}
I know that after the first iteration of the outer loop the min element will be at index 0.
I just want to know what name of algorithm is this.
algorithm sorting
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
#include <iostream>
int main() {
int arr[10]{10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
for (int i = 0; i < 10; i++) {
for (int j = i + 1; j < 10; j++) {
if (arr[i] > arr[j]) {
std::swap(arr[i], arr[j]);
}
}
}
// now the array is sorted!
return 0;
}
I know that after the first iteration of the outer loop the min element will be at index 0.
I just want to know what name of algorithm is this.
algorithm sorting
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
#include <iostream>
int main() {
int arr[10]{10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
for (int i = 0; i < 10; i++) {
for (int j = i + 1; j < 10; j++) {
if (arr[i] > arr[j]) {
std::swap(arr[i], arr[j]);
}
}
}
// now the array is sorted!
return 0;
}
I know that after the first iteration of the outer loop the min element will be at index 0.
I just want to know what name of algorithm is this.
algorithm sorting
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
#include <iostream>
int main() {
int arr[10]{10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
for (int i = 0; i < 10; i++) {
for (int j = i + 1; j < 10; j++) {
if (arr[i] > arr[j]) {
std::swap(arr[i], arr[j]);
}
}
}
// now the array is sorted!
return 0;
}
I know that after the first iteration of the outer loop the min element will be at index 0.
I just want to know what name of algorithm is this.
algorithm sorting
algorithm sorting
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
asked 8 mins ago
Mohamed MagdyMohamed Magdy
1
1
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Mohamed Magdy is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Mohamed Magdy is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215123%2fis-this-considered-bubble-sort-or-selection-sort%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Mohamed Magdy is a new contributor. Be nice, and check out our Code of Conduct.
Mohamed Magdy is a new contributor. Be nice, and check out our Code of Conduct.
Mohamed Magdy is a new contributor. Be nice, and check out our Code of Conduct.
Mohamed Magdy is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f215123%2fis-this-considered-bubble-sort-or-selection-sort%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
