We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 63049b8 + b96bab7 commit 988572eCopy full SHA for 988572e
Sorts/flashSort.js
@@ -30,7 +30,7 @@ function flashSort(arr) {
30
}
31
32
for (let j = 0; j < n; ++j) {
33
- k = ~~(c1 * (arr[j] - min));
+ let k = ~~(c1 * (arr[j] - min));
34
++l[k];
35
36
@@ -44,7 +44,7 @@ function flashSort(arr) {
44
45
// permutation
46
let move = 0, t, flash;
47
- j = 0;
+ let j = 0;
48
k = m - 1;
49
50
while (move < (n - 1)) {
@@ -66,7 +66,7 @@ function flashSort(arr) {
66
// insertion
67
for (j = 1; j < n; j++) {
68
hold = arr[j];
69
- i = j - 1;
+ let i = j - 1;
70
while (i >= 0 && arr[i] > hold) {
71
arr[i + 1] = arr[i--];
72
0 commit comments