Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 2f7a8f0

Browse files
feat: solve left rotation by k using reversal algorithm
1 parent c550303 commit 2f7a8f0

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed

‎Topic6/index.js

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -59,3 +59,22 @@ for (let i = 0; i < arr5.length; i++) {
5959
temp[i] = arr5[(i + k3) % arr5.length];
6060
}
6161
console.log(temp);
62+
63+
// Left rotation of an Array using reversal algorithm
64+
let arr6 = [1, 2, 3, 4, 5];
65+
let k4 = Number(prompt("Enter a value"));
66+
k4 = k4 % arr6.length;
67+
reverse(0, k4 - 1);
68+
reverse(k4, arr6.length - 1);
69+
reverse(0, arr6.length - 1);
70+
console.log(arr6);
71+
72+
function reverse(i, j) {
73+
while (i < j) {
74+
let temp = arr6[i];
75+
arr6[i] = arr6[j];
76+
arr6[j] = temp;
77+
i++;
78+
j--;
79+
}
80+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /