I want to switch this psuedo code into java!

I'm just not sure how to do it

using a java code how can i implement a memorization technique within a within a weighted interval scheduling.

p(1), p(2), ... P(n)

I kind of have a psuedo code but i don't know how to translate that into java code

First

Create hash table

check every weighted interval, check whether the values are present or not

if value not present go to binary search algorithm

put result in hash

I'm more concerned over the P(1) P(2) .... P(N)

end

Weighted Interval Scheduling: Memoization Memoization. Store results of each sub-problem in a cache; lookup as needed. Sort jobs by finish times so that i S f2 s Compute p (1),p(2),., P(n) S fn. for j 1 to n MIempty global array M-Compute-opt (j) if (MIj] is empty) M[jl max (w M-Compute-opt (p (j)), M-Compute-Opt (j-1)) return M[j] Weighted Interval Scheduling: Memoization Memoization. Store results of each sub-problem in a cache; lookup as needed. Sort jobs by finish times so that i S f2 s Compute p (1),p(2),., P(n) S fn. for j 1 to n MIempty global array M-Compute-opt (j) if (MIj] is empty) M[jl max (w M-Compute-opt (p (j)), M-Compute-Opt (j-1)) return M[j]