Last two paragraphs copy pasted from the linked book: Before continuing with a discussion of the time efficiency of algorithms we should point out that quite often time efficiency and space efficiency are interrelated, and trade-offs between time and space efficiency can be made. Consider, for example, the problem of sorting a deck of cards numbered 1–300. ............. The extra space afforded by the table allows for a more time-efficient sorting algorithm.

How do programmers compare the time ef􏰁iciency of two algorithms? The f􏰁irst approach that comes to mind is simply to code the algorithms and then compare the execution times after running the two programs. The one with the shorter execution time is clearly the better algorithm. .............. When selecting which operation to count, we want to be sure to select an operation that is executed at least as many times as any other operation during the course of the algorithm. -> copy paste https://books.google.nl/books?id=LSbtDAAAQBAJ&pg=PA44&lpg=PA44&dq=Before+continuing+with+a+discussion+of+the+time+efficiency+of+algorithms+we+should+point+out+that+quite+often+time+efficiency+and+space+efficiency+are+in