Skip to content

Instantly share code, notes, and snippets.

View code-reaper08's full-sized avatar
🔄
To iterate is human, to recurse divine.

Vishwa R code-reaper08

🔄
To iterate is human, to recurse divine.
View GitHub Profile
@code-reaper08
code-reaper08 / Callback.js
Created August 10, 2021 18:08
Callback functions
function Readfile(filename, sizefinder) {
console.log('Reading file.....');
sizefinder();
}
function sizefinder() {
console.log('File size is 32mb');
}
Readfile('sampletxt', sizefinder);
@code-reaper08
code-reaper08 / Array.js
Created July 27, 2021 18:42
Final program
function Reverse(samparr, begin, end) {
while (begin < end) {
temp = samparr[begin];
samparr[begin] = samparr[end];
samparr[end] = temp;
begin = begin + 1;
end = end - 1;
}
}
@code-reaper08
code-reaper08 / Array.js
Created July 27, 2021 18:27
Rotate function
function Rotate(samparr, d, n) {
if (d == 0) {
return;
}
Reverse(samparr, 0, d - 1);
Reverse(samparr, d, n - 1);
Reverse(samparr, 0, n - 1);
}
@code-reaper08
code-reaper08 / Array.js
Created July 27, 2021 18:15
When d>n example
// let us have an array of n = 3 and d = 4
let samparr = [1,2,3];
// step 1 -> reverse d elements.
let samparr = ["out of bounds"]
// To resolve this we refactor d as d = d % n,
// so d becomes 1 and 1<n so we rotate the array with d as 1.
let samparr = [1,2,3];
@code-reaper08
code-reaper08 / Array.js
Created July 27, 2021 17:59
Reverse function
function Reverse(samparr, begin, end) {
while (begin < end) {
temp = samparr[begin];
samparr[begin] = samparr[end];
samparr[end] = temp;
begin = begin + 1;
end = end - 1;
}
}
@code-reaper08
code-reaper08 / Array.js
Created July 27, 2021 17:39
Reversal algorithm example
// sample array
let samparr = [1,2,3,4,5];
// step 1 -> reverse d elements.
let samparr = [2,1,3,4,5];
// step 2 -> reverse n-d elements. Here n=5 and d=2 so (n-d) = (5-2=3)
let samparr = [2,1,5,4,3];
// step 3 -> reverse n elements. This gives the rotated array.
@code-reaper08
code-reaper08 / Substring.js
Last active July 24, 2021 17:50
3rd for loop
let inpstring = "abc";
let n = inpstring.length;
function FindSubstring(Str, n){
for(let i=0; i<n ;i++){
for(let j=i;j<n;j++){
for(let k=i;k<j+1;k++){
console.log(Str.charAt(k))
}
}
}
@code-reaper08
code-reaper08 / Substring.js
Created July 24, 2021 17:27
2nd for loop
let inpstring = "abc";
let n = inpstring.length;
function FindSubstring(Str, n){
for(let i=0; i<n ;i++){
for(let j=i;j<n;j++){
// another for loop comes here
}
}
}
@code-reaper08
code-reaper08 / Function.js
Created July 24, 2021 17:18
Creating function
let inpstring = "abc";
let n = inpstring.length;
function FindSubstring(Str, n){
for(let i=0; i<n ;i++){
// We are going to have two more loops here
}
}
}
}
// Initialising input string
let inpstring = "Hello";
// length of the input string
let n = inpstring.length;