My Board

Suppose we divide the array A into left and right halves. Where can the largest subrange be?It is either in the left half or the right half, or includes the middle.

Quite vague, what this "included the middle" might be. Although it is cleared up in the following text. Still...

This sentence: Therefore, after lg n rounds we will have identified the square root to within ±1. Мой исходный перевод: Продолжая рекурсивно подобным образом в соответствующих половинах мы определим квадратный корень с точностью до ±1 за lg n сравнений. Отредактирован до: Продолжая действовать подоб...

4-13. [5] A camera at the door tracks the entry time ai and exit time bi (assume bi > ai) for each of n persons pi attending a party. Having difficult time figuring out this "each of n persons pi". In particular, what is "pi"? Oh, I think, I see. Total party time? I don't see, t...

4-5 [3] The mode of a bag of numbers is the number that occurs most frequently in the set. The set {4, 6, 2, 4, 3, 1} has a mode of 4. Give an efficient and correct algorithm to compute the mode of a bag of n numbers. So, what is it, a BAG or a SET of numbers? What is the difference between a bag a...

a low pile containing all the elements that are < p, and a high pile containing all the elements that are ≥ p. Low and high denote the array positions into which we place the respective piles, leaving a single slot between them for p. If the high pile contains all the elements that are ≥ p, then p ...

Build a hash table using chaining, and then compare each of the (expected constant) pairs of items within a bucket. I am having problems figuring out what the (expected constant) refers to. It looks like the execution time, but how does it relate to the pairs of items in a bucket? The comparison is...

I am trying to create a 2D model of a simple protractor for engraving. Something like this: https://viewclear.net/myblog/wp-content/uploads/2021/02/circle-jpeg.jpg Unfortunately, I’ve been having one hell of a time with it. The way I figure to go about it is like this. Create two concentric circles....

That should knock off a factor of O(log n). Я изначально перевел это как: "Это должно сократить время исполнения НА O(log n), " но редактор исправил это на: Это сократит время исполнения ДО O(logn) Теоретическая составляющая данного аргумента по большому счету выше моей компетенции, но гр...

Each cell is initialized to null, as shown in Figure 3.11.

Actually, I don't see each cell in Figure 3.11 initialized to null.

Collision resolution by chaining, after hashing the first eight Fibonacci numbers in increasing order, with hash function H(x) = (2x + 1) mod 10. What exactly are we chaining with the hash function? The first eight Fibonacci numbers? Or are we hashing the first eight Fibonacci number with hash func...