We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents c661604 + e92ccf7 commit 9a1d26bCopy full SHA for 9a1d26b
algorithm/sorting/pancake/basic/code.js
@@ -21,7 +21,7 @@ for (var i=0;i<N-1;i++) {
21
var currMax = currArr.reduce((prev, curr, idx) => {
22
return (curr > prev.val) ? { idx: idx, val: curr} : prev;
23
}, {idx: 0, val: currArr[0]});
24
- if (currMax.idx !== i) {
+ if (currMax.idx !== 0) { // if currMax.idx === 0 that means max element already at the bottom, no flip required
25
logger._print('flip at ' + (currMax.idx+i) + ' (step 1)');
26
flip(currMax.idx+i, N);
27
logger._print('flip at ' + (i) + ' (step 2)');
0 commit comments