pseudocode

Java balanced expressions check {[()]}

I hope this code can help: import java.util.Stack; public class BalancedParenthensies { public static void main(String args[]) { System.out.println(balancedParenthensies(“{(a,b)}”)); System.out.println(balancedParenthensies(“{(a},b)”)); System.out.println(balancedParenthensies(“{)(a,b}”)); } public static boolean balancedParenthensies(String s) { Stack<Character> stack = new Stack<Character>(); for(int i = 0; i < s.length(); i++) { char c = s.charAt(i); if(c == ‘[‘ || c == ‘(‘ || c … Read more

Algorithm for sampling without replacement?

Here’s some code for sampling without replacement based on Algorithm 3.4.2S of Knuth’s book Seminumeric Algorithms. void SampleWithoutReplacement ( int populationSize, // size of set sampling from int sampleSize, // size of each sample vector<int> & samples // output, zero-offset indicies to selected items ) { // Use Knuth’s variable names int& n = sampleSize; … Read more

help in the Donalds B. Johnson’s algorithm, i cannot understand the pseudo code (PART II)

It works! In an earlier iteration of the Johnson algorithm, I had supposed that A was an adjacency matrix. Instead, it appears to represent an adjacency list. In that example, implemented below, the vertices {a, b, c} are numbered {0, 1, 2}, yielding the following circuits. Addendum: As noted in this proposed edit and helpful … Read more

Two Rectangles intersection

if (X1+W1<X2 or X2+W2<X1 or Y1+H1<Y2 or Y2+H2<Y1): Intersection = Empty else: Intersection = Not Empty If you have four coordinates – ((X,Y),(A,B)) and ((X1,Y1),(A1,B1)) – rather than two plus width and height, it would look like this: if (A<X1 or A1<X or B<Y1 or B1<Y): Intersection = Empty else: Intersection = Not Empty