algs4 | Coursera Algorithms assignments and book exercises | Learning library

I am trying to check whether my levelorder of my Binary Search Tree is equal to the other one. To do this, I tried to make a compareTo method. I only give equal values to the method, but it keeps on saying the condition is false. When I place breakpoints, I see that the values are still equal. I am probably not understanding it correctly. Does anyone know how to solve this?

Here is what I did, as you can see below, the compareTo returns a 1 instead of a 0:

I have this method that prints my permutations of a Set I'm giving with my parameters. But I need to save them in 2 separate sets and compare them. So, for instance I have [5,6,3,1] and [5,6,1,3], by adding them in two separate BST, I can compare them by using the compareTo function to check whether their level order is the same. But I am having trouble with saving these permutations from my method into a set in my main. Does anyone know how to save these into a set?

What I have now:

I used the percolation class from the algs4.jar library, where you can simulate a whole labyrinth and see where the leaks are. I want to show the leaks that are from top to bottom, but now I get to see all of the leaks.

Does anyone know how I can see only the leaks that are percolations?

I thought maybe using dfs from the flow method in de Percolation.java class, and say something like only show when index i in rows is maxlength and marked but I don't really know how to say that, because I am not sure if this statement will show the entire leak of just the max length leak.

code I run AssignmentTwo.java:

I would like to count how many edges there are that goes between a white and a red node. The red nodes are the ones in the new int[] in the main method.

Provided code for the assignment:

Am trying to incorporate some C# code into my PowerShell, as I am still learning C# and getting a foothold on learning a new language.

I am able to open a file locally on my computer and read it line by line. But cannot seem to work out how to open a file from the internet and parse it line by line.

This works to read the file line by line, and allows me to take action on the line items in the loop.

I'm currently working on Robert Sedgewicks Algorithm's book. I'm trying to implement Heap sort but I'm coming across an error

'sink': undefined method >' for nil:NilClass

This error happens because of the when the array is pass to the sort method it has 11 elements at 0 index. when it swaps index n (the number of elements in the array) with 1 is comparing nil with a string. Meaning n is 11 but there is no 11 index because the array index starts at 0.

Here is the Java implementation for the Heap sort method in the book:

I can really use some help with this parameterized test case I am trying to create. No matter what kind of constructor I create the IDE gives an error message. Here is my code:

When I'm running java -cp foo.jar MyClass I keep getting the error:

I am reading "Algorithms 4th Edition" by Robert Sedgewick and Kevin Wayne.

The following code is my answer for the exercise 1.2.9 on p.115.

I expect this code prints the total number of keys examined during all searches but this code doesn't print the value of the counter.

Why?