Modify to achieve inverse insertion sort in python step by step
-1
How to modify this such that it starts from the right of the list and sorts until where the counter is.And show step by step before obtaining output.
def insertion_sort(list):
for index in range(1, len(list)):
current_value = list[index]
position = index
while position > 0 and list[position - 1] > current_value:
list[position] = list[position - 1]
position = position - 1
list[position] = current_value
list = [88, 90, 5, 19, 23, 41, 2, 83, 60]
insertion_sort(list)
print(list)
python insertion-sort inverse
asked Nov 21 '18 at 11:34
Myung
62
add a comment |
-1
How to modify this such that it starts from the right of the list and sorts until where the counter is.And show step by step before obtaining output.
def insertion_sort(list):
for index in range(1, len(list)):
current_value = list[index]
position = index
while position > 0 and list[position - 1] > current_value:
list[position] = list[position - 1]
position = position - 1
list[position] = current_value
list = [88, 90, 5, 19, 23, 41, 2, 83, 60]
insertion_sort(list)
print(list)
python insertion-sort inverse
asked Nov 21 '18 at 11:34
Myung
62
Could provide the expected/desired output of your script?
– Rolvernew
Nov 21 '18 at 11:43
the output is 90, 88, 83, 60, 41, 23, 19, 5, 2
– Myung
Nov 21 '18 at 11:49
add a comment |
-1
-1
-1
0
How to modify this such that it starts from the right of the list and sorts until where the counter is.And show step by step before obtaining output.
def insertion_sort(list):
for index in range(1, len(list)):
current_value = list[index]
position = index
while position > 0 and list[position - 1] > current_value:
list[position] = list[position - 1]
position = position - 1
list[position] = current_value
list = [88, 90, 5, 19, 23, 41, 2, 83, 60]
insertion_sort(list)
print(list)
python insertion-sort inverse
asked Nov 21 '18 at 11:34
Myung
62
How to modify this such that it starts from the right of the list and sorts until where the counter is.And show step by step before obtaining output.
def insertion_sort(list):
for index in range(1, len(list)):
current_value = list[index]
position = index
while position > 0 and list[position - 1] > current_value:
list[position] = list[position - 1]
position = position - 1
list[position] = current_value
list = [88, 90, 5, 19, 23, 41, 2, 83, 60]
insertion_sort(list)
print(list)
python insertion-sort inverse
python insertion-sort inverse
asked Nov 21 '18 at 11:34
Myung
62
asked Nov 21 '18 at 11:34
Myung
62
edited Nov 21 '18 at 12:31
asked Nov 21 '18 at 11:34
Myung
62
asked Nov 21 '18 at 11:34
Myung
62
asked Nov 21 '18 at 11:34
Myung
62
62
Could provide the expected/desired output of your script?
– Rolvernew
Nov 21 '18 at 11:43
the output is 90, 88, 83, 60, 41, 23, 19, 5, 2
– Myung
Nov 21 '18 at 11:49
add a comment |
Could provide the expected/desired output of your script?
– Rolvernew
Nov 21 '18 at 11:43
the output is 90, 88, 83, 60, 41, 23, 19, 5, 2
– Myung
Nov 21 '18 at 11:49
Could provide the expected/desired output of your script?
– Rolvernew
Nov 21 '18 at 11:43
Could provide the expected/desired output of your script?
– Rolvernew
Nov 21 '18 at 11:43
the output is 90, 88, 83, 60, 41, 23, 19, 5, 2
– Myung
Nov 21 '18 at 11:49
the output is 90, 88, 83, 60, 41, 23, 19, 5, 2
– Myung
Nov 21 '18 at 11:49
add a comment |
1 Answer
1
active
oldest
votes
0
You may want to change
while position > 0 and list[position - 1] > current_value:
to
while position > 0 and list[position - 1] < current_value:
answered Nov 21 '18 at 12:15
leoburgy
1086
add a comment |
Your Answer
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: "1"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});
}
});
draft saved
draft discarded
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%2fstackoverflow.com%2fquestions%2f53411212%2fmodify-to-achieve-inverse-insertion-sort-in-python-step-by-step%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
0
You may want to change
while position > 0 and list[position - 1] > current_value:
to
while position > 0 and list[position - 1] < current_value:
answered Nov 21 '18 at 12:15
leoburgy
1086
add a comment |
0
You may want to change
while position > 0 and list[position - 1] > current_value:
to
while position > 0 and list[position - 1] < current_value:
answered Nov 21 '18 at 12:15
leoburgy
1086
add a comment |
0
0
0
You may want to change
while position > 0 and list[position - 1] > current_value:
to
while position > 0 and list[position - 1] < current_value:
answered Nov 21 '18 at 12:15
leoburgy
1086
You may want to change
while position > 0 and list[position - 1] > current_value:
to
while position > 0 and list[position - 1] < current_value:
answered Nov 21 '18 at 12:15
leoburgy
1086
answered Nov 21 '18 at 12:15
leoburgy
1086
answered Nov 21 '18 at 12:15
leoburgy
1086
answered Nov 21 '18 at 12:15
leoburgy
1086
1086
add a comment |
add a comment |
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- 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.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
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%2fstackoverflow.com%2fquestions%2f53411212%2fmodify-to-achieve-inverse-insertion-sort-in-python-step-by-step%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
Could provide the expected/desired output of your script?
– Rolvernew
Nov 21 '18 at 11:43
the output is 90, 88, 83, 60, 41, 23, 19, 5, 2
– Myung
Nov 21 '18 at 11:49