const gcd = (...arr) => {
  const _gcd = (x, y) => (!y ? x : gcd(y, x % y));
  return [...arr].reduce((a, b) => _gcd(a, b));
};

gcd(8, 36); // 4
gcd(...[12, 8, 32]); // 4

function printHeap(heap, index, level) {
    if (index >= heap.length) {
        return;
    }
    console.log("  ".repeat(level) + heap[index]);
    printHeap(heap, 2 * index + 1, level + 1);
    printHeap(heap, 2 * index + 2, level + 1);
}

//You can call this function by passing in the heap array and the index of the root node, which is typically 0, and level = 0.

let heap = [3, 8, 7, 15, 17, 30, 35, 2, 4, 5, 9];
printHeap(heap,0,0)

import { createSlice } from "@reduxjs/toolkit";

const alert = createSlice({
	name: "alert",
	initialState: {
	msg: "",
	status: "",
	},
	reducers: {
	set_alert: (state, action) => {
	return {
	...state,
	msg: action.payload.msg,
	status: action.payload.status,
	};
	},
	clear_alert: (state, action) => {
	return {
	...state,
	msg: "",
	status: "",
	};
	},
	},
});

export default alert.reducer;

const { set_alert, clear_alert } = alert.actions;

export const setAlert = (msg, status) => dispatch => {
	dispatch(set_alert({ msg, status }));
	setTimeout(() => dispatch(clear_alert()), 4000);
};

export const clearAlert = () => dispatch => {
	dispatch(clear_alert());
};

//JavaScript program to swap two variables

//take input from the users
let a = prompt('Enter the first variable: ');
let b = prompt('Enter the second variable: ');

//using destructuring assignment
[a, b] = [b, a];

console.log(`The value of a after swapping: ${a}`);
console.log(`The value of b after swapping: ${b}`);

const geometricProgression = (end, start = 1, step = 2) =>
  Array.from({
    length: Math.floor(Math.log(end / start) / Math.log(step)) + 1,
  }).map((_, i) => start * step ** i);
  
geometricProgression(256); // [1, 2, 4, 8, 16, 32, 64, 128, 256]
geometricProgression(256, 3); // [3, 6, 12, 24, 48, 96, 192]
geometricProgression(256, 1, 4); // [1, 4, 16, 64, 256]

const union = (...arr) => [...new Set(arr.flat())];

// Example
union([1, 2], [2, 3], [3]);     // [1, 2, 3]