courseware | Courseware setup and information for instructors | Runtime Evironment library

Two reasons:

1. Your test class name doesn't match the regex you have in your surefire configuration. You have explicitly said that the class name needs to match *Test*

2. You are importing the @Test annotation from org.junit, not org.junit.jupiter.api.Test

You need to use the value of the $sql array inside your loop.

Change the following...

Given the condition above in A why go to the left? instead of the right?

If you would go to the right (without first checking condition B), there is a small probability that the values at the right will keep going down (from left to right), and you would not find a peak there.

At the left side, however, you know that you cannot have that situation, as you have found at least one value that is higher (the neighbour) and could potentially even be a peak. Here is how you can prove that a peak exists at the left side (this is not a description of the algorithm; just a way to prove it):

If the immediate neighbour is not a peak, then possibly the next one to its left is. If not, then possibly the next one to its left....etc. This series will end when finding a peak or arriving at the left most value. If none of the others were peaks, then this one must be it. This only happens when the values never decreased while looking further to the left.

In short, whatever the situation at the left side, there is a peak somewhere there at that side, and that is all we need to know when choosing a side.

Given the condition above in B why go to the right? instead of the left?

This is of course the same reasoning, but mirrored.

Note that you can decide to first check condition B and only then A. When both conditions are true at the same time, you can actually choose which side to go. This is where you got the feeling from that the choice looks "arbitrary". It is indeed arbitrary when both conditions A and B are true.

But also think about the case where one of A and B is true and the other false. If you would go the wrong (downward) way, you have no guarantee that values would ever go up in that direction. And so there is a small probability that there is no peak on that side.

Of course, there still could be a peak on that side, but since we are sure there is one on the other side, it is wise to go for certainty. We don't care about potentially discarding some peaks, as we only need to find one peak.

The binary search algorithm assumes we start from a sorted array, so how come it makes sense to apply it to data that may be unsorted?

Binary search for a particular value would only work in a sorted array, but here we are not looking for a particular value. The conditions of the value we are looking for are less strict. Instead of a particular value, we will be happy with any value that is a local peak.

Explaining it by each line

This code will sort out your problem :

The nulls at the first line are happening because you have 2 repeated conditional statements if (i == 0) and the other nulls on each line are happening because you are concatenating the char with the string using += which is giving nullA etc so instead do this:

In a nutshell, the characters are inside the file (probably by accident) and read_csv is right to not remove them automatically: since they occur within quotes, this by convention means that a CSV parser should treat the field as-is, and not strip out whitespace characters. read.csv is wrong to do so, and this is arguably a bug.

You can strip them out yourself once you’ve loaded the data:

None seems fine if you're going to do it this way. (I'd say it's safer than using a large negative number.) You can get round the code duplication with None as e.g.

As you've probably already figured out, the many subtitle formats are directly supported by Weblate, so yes it's possible to translate non software projects.

Weblate can be used for localizing any kind of content - I've seen localizing projects for printed media or books as well.