I am developing Bilateral filter, a skin correction algorithm, using javascript, but it is not working well. If anyone has had success, please send me the code.

I’d like to find the average number of comparisons for finding ALL minimum values in an array.

Suppose you have an elevator that only consists of up and down buttons.
It means that it can only go up as much as “up” or go down as much as “down”.
Suppose we want to go from floor A to B. Using the dynamic programming method, write an algorithm that moves from floor A to B with the least number of button presses.
Input: up, down, A, B, and the output is the least number of button presses.

Parinaz is trapped inside the building elevator due to karma, which can only go from the ground floor (0) to the B floor.
It has two buttons up and down. He wants to go u floor up and d floor down
A is located and needs to reach the level of B as quickly as possible. Using the dynamic programming method, write a program that has the lowest number.

I’m working on implementing Dijkstra’s algorithm in Java to find the shortest paths in a graph. While I’ve written the code below, I’m encountering issues with its functionality. Here’s the code:

Given the center and shape matrix of the two ellipsoids,how do I know that ellipsoid E1 is inside ellipsoid E2?Judging by the center and shape matrix.Hopefully, I can prove it mathematically.

Given array of length n. I need to find amount of subarrays (or amount of pairs 1 <= l <= r <= n) such that OR(a[l], a[l+1], ..., a[r]) > max(a[l], a[l+1], ..., a[r]) for O(nlogn * T), where T = max(a[i]).

I need to implement data structure that can answer for O(logn) to these queries:

I have a task:

Explain the algo and data structure used in the working of elevator?