Quite vague, what this "included the middle" might be. Although it is cleared up in the following text. Still...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.

## Search found 26 matches

- Tue Jun 08, 2021 3:05 pm
- Forum: Chapter 5. Divide and Conquer
- Topic: Section 5.6.
- Replies:
**0** - Views:
**45**

### Section 5.6.

- Sat Jun 05, 2021 5:50 pm
- Forum: Chapter 5. Divide and Conquer
- Topic: Section 4.9.3 (2nd Ed.), 5.1.3 (3rd Ed) - 4.9.3 Square and Other Roots
- Replies:
**0** - Views:
**28**

### Section 4.9.3 (2nd Ed.), 5.1.3 (3rd Ed) - 4.9.3 Square and Other Roots

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

- Thu Jun 03, 2021 8:58 pm
- Forum: Chapter 4. Sorting
- Topic: Exercise 4.13
- Replies:
**0** - Views:
**45**

### Exercise 4.13

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...

- Thu Jun 03, 2021 8:17 pm
- Forum: Chapter 4. Sorting
- Topic: Exercise 4.5
- Replies:
**0** - Views:
**33**

### Exercise 4.5

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...

- Tue Jun 01, 2021 6:54 pm
- Forum: Chapter 4. Sorting
- Topic: Section 4.6
- Replies:
**0** - Views:
**37**

### Section 4.6

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 ...

- Mon May 31, 2021 12:33 pm
- Forum: Chapter 4. Sorting
- Topic: Page 113
- Replies:
**0** - Views:
**30**

### Page 113

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...

- Sat May 29, 2021 7:57 pm
- Forum: ArtCAM Adventures
- Topic: Dividing a circle into a certain number of segments
- Replies:
**0** - Views:
**46**

### Dividing a circle into a certain number of segments

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....

- Sat May 29, 2021 7:22 pm
- Forum: Chapter 3. Data Structures
- Topic: Page 100
- Replies:
**0** - Views:
**50**

### Page 100

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

- Sat May 29, 2021 11:55 am
- Forum: Chapter 3. Data Structures
- Topic: Page 94
- Replies:
**0** - Views:
**36**

### Page 94

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

- Sat May 29, 2021 10:57 am
- Forum: Chapter 3. Data Structures
- Topic: Figure 3.10
- Replies:
**0** - Views:
**35**

### Figure 3.10

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...