# Difference between revisions of "TADM2E 3.4"

From Algorithm Wiki

(Recovering wiki) |
(Recovering wiki) |
||

Line 1: | Line 1: | ||

− | Since 1,2,...,n is finite, use a bit array to represent them. | + | Since 1,2,...,n is finite, use a bit array to represent them.<br> |

− | See the telephone number sorting example in Column 1 of | + | See the telephone number sorting example in Column 1 of <Programming Pearls> (Jon Bentley) for detailed explanation. |

[[Data-structures-TADM2E|Back to ''Data Structures'' Problems]]... | [[Data-structures-TADM2E|Back to ''Data Structures'' Problems]]... |

## Latest revision as of 18:22, 11 September 2014

Since 1,2,...,n is finite, use a bit array to represent them.

See the telephone number sorting example in Column 1 of <Programming Pearls> (Jon Bentley) for detailed explanation.