Mixing
How do I reconsider the new pivot so that it reruns the if statement?
0
I am trying to create an algorithm for quicksort. When I run this code, it is a never ending loop of the pivot getting smaller and smaller. However, the pivot number would be smaller than an item in the array. I need it to re-look at my top if statement to check whether the pivot number is smaller or not.
new_numbers = [23, 76, -18, -83, 1, 34, 19, 24, 1312, 56, -123, 52, -5, -22, 44, 16]
pivot = len(new_numbers)-1
while 1 == 1:
pivot = pivot
if any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
increment = 0
for i in range(pivot):
if new_numbers[i] < new_numbers[pivot]:
new_numbers[increment], new_numbers[i] = new_numbers[i], new_numbers[increment]
increment=increment + 1
new_numbers[increment],new_numbers[pivot] = new_numbers[pivot],new_numbers[increment]
elif any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
pivot = increment - 1
if any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
increment -= 1
pivot = increment - 1
print(new_numbers)
python algorithm loops sorting if-statement
edited Nov 19 '18 at 18:48
LoneWanderer
640820
asked Nov 19 '18 at 17:31
Sean Li
11
add a comment |
0
I am trying to create an algorithm for quicksort. When I run this code, it is a never ending loop of the pivot getting smaller and smaller. However, the pivot number would be smaller than an item in the array. I need it to re-look at my top if statement to check whether the pivot number is smaller or not.
new_numbers = [23, 76, -18, -83, 1, 34, 19, 24, 1312, 56, -123, 52, -5, -22, 44, 16]
pivot = len(new_numbers)-1
while 1 == 1:
pivot = pivot
if any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
increment = 0
for i in range(pivot):
if new_numbers[i] < new_numbers[pivot]:
new_numbers[increment], new_numbers[i] = new_numbers[i], new_numbers[increment]
increment=increment + 1
new_numbers[increment],new_numbers[pivot] = new_numbers[pivot],new_numbers[increment]
elif any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
pivot = increment - 1
if any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
increment -= 1
pivot = increment - 1
print(new_numbers)
python algorithm loops sorting if-statement
edited Nov 19 '18 at 18:48
LoneWanderer
640820
asked Nov 19 '18 at 17:31
Sean Li
11
while 1 == 1:and not exit condition ?!
– LoneWanderer
Nov 19 '18 at 17:41
Would the while loop be:while any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
– Sean Li
Nov 19 '18 at 18:24
I surely have an idea concerning how quick sort is implemented, but it looks like an assignment. The question is rather algorithm-oriented, and you need to tell us why you made an loop, and how it is supposed to stop. I strongly advise you to use paper+pen with a simple example and do this by hand, then revise your code, then run it step by step under debugger and closely watch for your variables changes.
– LoneWanderer
Nov 19 '18 at 19:02
add a comment |
0
0
0
I am trying to create an algorithm for quicksort. When I run this code, it is a never ending loop of the pivot getting smaller and smaller. However, the pivot number would be smaller than an item in the array. I need it to re-look at my top if statement to check whether the pivot number is smaller or not.
new_numbers = [23, 76, -18, -83, 1, 34, 19, 24, 1312, 56, -123, 52, -5, -22, 44, 16]
pivot = len(new_numbers)-1
while 1 == 1:
pivot = pivot
if any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
increment = 0
for i in range(pivot):
if new_numbers[i] < new_numbers[pivot]:
new_numbers[increment], new_numbers[i] = new_numbers[i], new_numbers[increment]
increment=increment + 1
new_numbers[increment],new_numbers[pivot] = new_numbers[pivot],new_numbers[increment]
elif any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
pivot = increment - 1
if any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
increment -= 1
pivot = increment - 1
print(new_numbers)
python algorithm loops sorting if-statement
edited Nov 19 '18 at 18:48
LoneWanderer
640820
asked Nov 19 '18 at 17:31
Sean Li
11
I am trying to create an algorithm for quicksort. When I run this code, it is a never ending loop of the pivot getting smaller and smaller. However, the pivot number would be smaller than an item in the array. I need it to re-look at my top if statement to check whether the pivot number is smaller or not.
new_numbers = [23, 76, -18, -83, 1, 34, 19, 24, 1312, 56, -123, 52, -5, -22, 44, 16]
pivot = len(new_numbers)-1
while 1 == 1:
pivot = pivot
if any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
increment = 0
for i in range(pivot):
if new_numbers[i] < new_numbers[pivot]:
new_numbers[increment], new_numbers[i] = new_numbers[i], new_numbers[increment]
increment=increment + 1
new_numbers[increment],new_numbers[pivot] = new_numbers[pivot],new_numbers[increment]
elif any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
pivot = increment - 1
if any(new_numbers[pivot] >= item for item in new_numbers[:pivot]):
increment -= 1
pivot = increment - 1
print(new_numbers)
python algorithm loops sorting if-statement
python algorithm loops sorting if-statement
edited Nov 19 '18 at 18:48
LoneWanderer
640820
asked Nov 19 '18 at 17:31
Sean Li
11
edited Nov 19 '18 at 18:48
LoneWanderer
640820
asked Nov 19 '18 at 17:31
Sean Li
11
edited Nov 19 '18 at 18:48
LoneWanderer
640820
edited Nov 19 '18 at 18:48
LoneWanderer
640820
edited Nov 19 '18 at 18:48
LoneWanderer
640820
640820
asked Nov 19 '18 at 17:31
Sean Li
11
asked Nov 19 '18 at 17:31
Sean Li
11
asked Nov 19 '18 at 17:31
Sean Li
11
11
while 1 == 1:and not exit condition ?!
– LoneWanderer
Nov 19 '18 at 17:41
Would the while loop be:while any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
– Sean Li
Nov 19 '18 at 18:24
I surely have an idea concerning how quick sort is implemented, but it looks like an assignment. The question is rather algorithm-oriented, and you need to tell us why you made an loop, and how it is supposed to stop. I strongly advise you to use paper+pen with a simple example and do this by hand, then revise your code, then run it step by step under debugger and closely watch for your variables changes.
– LoneWanderer
Nov 19 '18 at 19:02
add a comment |
while 1 == 1:and not exit condition ?!
– LoneWanderer
Nov 19 '18 at 17:41
Would the while loop be:while any(new_numbers[pivot] < item for item in new_numbers[:pivot]):
– Sean Li
Nov 19 '18 at 18:24
I surely have an idea concerning how quick sort is implemented, but it looks like an assignment. The question is rather algorithm-oriented, and you need to tell us why you made an loop, and how it is supposed to stop. I strongly advise you to use paper+pen with a simple example and do this by hand, then revise your code, then run it step by step under debugger and closely watch for your variables changes.
– LoneWanderer
Nov 19 '18 at 19:02
while 1 == 1: and not exit condition ?!– LoneWanderer
Nov 19 '18 at 17:41
while 1 == 1: and not exit condition ?!– LoneWanderer
Nov 19 '18 at 17:41
Would the while loop be:
while any(new_numbers[pivot] < item for item in new_numbers[:pivot]):– Sean Li
Nov 19 '18 at 18:24
Would the while loop be:
while any(new_numbers[pivot] < item for item in new_numbers[:pivot]):– Sean Li
Nov 19 '18 at 18:24
I surely have an idea concerning how quick sort is implemented, but it looks like an assignment. The question is rather algorithm-oriented, and you need to tell us why you made an loop, and how it is supposed to stop. I strongly advise you to use paper+pen with a simple example and do this by hand, then revise your code, then run it step by step under debugger and closely watch for your variables changes.
– LoneWanderer
Nov 19 '18 at 19:02
I surely have an idea concerning how quick sort is implemented, but it looks like an assignment. The question is rather algorithm-oriented, and you need to tell us why you made an loop, and how it is supposed to stop. I strongly advise you to use paper+pen with a simple example and do this by hand, then revise your code, then run it step by step under debugger and closely watch for your variables changes.
– LoneWanderer
Nov 19 '18 at 19:02
add a comment |
0
active
oldest
votes
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%2f53379856%2fhow-do-i-reconsider-the-new-pivot-so-that-it-reruns-the-if-statement%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
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%2f53379856%2fhow-do-i-reconsider-the-new-pivot-so-that-it-reruns-the-if-statement%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
while 1 == 1:and not exit condition ?!– LoneWanderer
Nov 19 '18 at 17:41
Would the while loop be:
while any(new_numbers[pivot] < item for item in new_numbers[:pivot]):– Sean Li
Nov 19 '18 at 18:24
I surely have an idea concerning how quick sort is implemented, but it looks like an assignment. The question is rather algorithm-oriented, and you need to tell us why you made an loop, and how it is supposed to stop. I strongly advise you to use paper+pen with a simple example and do this by hand, then revise your code, then run it step by step under debugger and closely watch for your variables changes.
– LoneWanderer
Nov 19 '18 at 19:02