## Algorithm New Question

• ### preventing sensitive data exposure using combinati

I wanted to use a combination of AES and 3DES algorithms to prevent sensitive data exposure in web site and web applications.I want to know is it a good combination and will it be effective and also ......

• ### LeetCode 1: How to translate the question two sum

I did the question "TwoSum" in ReasonML/Ocaml but I have no idea how to code that in Clojure with similar pseudo algorithm. Please comment how to translate this solution to ClojureClojure(def ......

• ### Dimensionality reduction doesn't improve the a

In many papers, I read dimension reduction improves the prediction result and the computation.In my case, my original data obtained high accuracy than the data I have obtained with Lasso and Genetic ......

• ### Are these two iterative approaches to find closest

myList = [500, 700, 1000, 1400, 2000, 6000]target_value = 1600diff = sys.maxintTwo iterations to find pair of numbers closest to sum. First approach using nested loop to check inner and outer ......

• ### How to check if rar-file is passworded?

I have to check if a rar-archive has a password or not using Java.I have a rar headers description (https://www.rarlab.com/technote.htm) but not understand how to read them.P.S. Junrar libs not ......

• ### Algorithm to turns a continues signal into binary

I had a nice project in mind, which I will probably not going to do because of a lack of time, but I had some theoretical problem I faced there, which still bother me and might be interesting for you ......

• ### How to fix skew trapezoidal distribution sampling

I am trying to generate a skewed trapezoidal distribution using inverse transform sampling.The inputs are the values where the ramps start and end (a, b, c, d) and the sample size.a=-3;b=-1;c=1;d=8; ......

• ### Optimal discount algorithm (set packing with weigh

Let's say we have some order with set of items: (Id: quantity)i1: 5i2: 3i3: 4i4: 5And some "offers" with discounts:(Id: items - dicount)o1: i2, i3 - 100o2: i3, i4 - 50o3: i4, i4 - 90o4: ......

• ### Can O(1) or O(log n) be used for the count of elem

I have a task that sounds like this:Let A be a sorted list with n elements. We would like to add some elementsinto A so that the entire list is sorted as well.(i) Give an O(n)-algorithm that adds ......

• ### Could an algorithm be non deterministic or ambiguo

CLSR says that an algorithm is a "well defined procedure".What exactly is meant by "well defined". Does it mean that it should not be ambiguous or non deterministic. If yes what could be meant by an ......

• ### Dynamic Programming Maximum Profit for Movers in 2

There is a moving company. It operates in two cities. They wish to maximize profit. Given are 2 arrays representing the two cities. The value at position i in each of the arrays indicates the maximum ......

• ### Partition an array into subsets of fixed size with

I have found versions of this problem for either 2 subsets of half the size of the original array or with any number of subsets of any length. Does anybody have any pointers to any good solution for ......

• ### Get all unique target sum compositions for a given

I'm dealing with a particularly nasty variant of the subset sum problem.Consider this example. Let's say we have several warehouses with different quantities of some item. For instance:London - 1 ......

• ### Subset sum of P elements (with repetition allowed)

Given an array A of N elements. We need to find the number of subsets (with repetition of numbers allowed) such that the number of elements in the subset is P and the sum of those P elements is ......

• ### Subset Sum With Paired Values

I have paired values, exactly food objects which haveint carb_value;int protein_value;int fat_value;int calories;as data fields.I'm trying to find all possible food combinations(allowing ......