TAOCP 5.5: Summary, History, and Bibliography

Section 5.5 exercises: 6/4 solved.

6 items

Section 5.5. Summary, History, and Bibliography

Exercises from TAOCP Volume 3 Section 5.5: 6/4 solved.

#	Rating	Category	Status	Time
1	[05]	simple	verified	1m10s
2	[20]	medium	solved	3m26s
3	[37]	project	verified	1m16s
4	▶ [28]	hard	solved	5m17s
5	[46]	research	verified	3m31s
81	[**]		verified	1m08s

Practice › Mathematics › TAOCP › TAOCP Vol 3: Sorting and Searching › TAOCP 5.5: Summary, History, and Bibliography ›

TAOCP 5.5 Exercise 1

The methods discussed in this chapter are unified by viewing external sorting as the problem of constructing initial sorted runs and then combining them by successive multiway merges until a single or...

Practice › Mathematics › TAOCP › TAOCP Vol 3: Sorting and Searching › TAOCP 5.5: Summary, History, and Bibliography ›

TAOCP 5.5 Exercise 2

Table 1 gives the following MIX running-time estimates for list-sorting methods: \begin{aligned} \text{List insertion:} \qquad &1.

Practice › Mathematics › TAOCP › TAOCP Vol 3: Sorting and Searching › TAOCP 5.5: Summary, History, and Bibliography ›

TAOCP 5.5 Exercise 3

Let a file consist of $N$ records with totally ordered keys.

Practice › Mathematics › TAOCP › TAOCP Vol 3: Sorting and Searching › TAOCP 5.5: Summary, History, and Bibliography ›

TAOCP 5.5 Exercise 4

A sorting algorithm is **parsimonious** if it satisfies two conditions: 1.

Practice › Mathematics › TAOCP › TAOCP Vol 3: Sorting and Searching › TAOCP 5.5: Summary, History, and Bibliography ›

TAOCP 5.5 Exercise 5

Let $R_1, R_2, \dots, R_N$ be a table of records with corresponding keys $K_1, K_2, \dots, K_N$.

Practice › Mathematics › TAOCP › TAOCP Vol 3: Sorting and Searching › TAOCP 5.5: Summary, History, and Bibliography ›

TAOCP 5.5 Exercise 81

At initialization $i \leftarrow 1$.